Derivation of Fibonacci closed form

In summary, the conversation discusses the derivation of the closed form of the Fibonacci sequence. The key is to look for solutions of the form f_n = c*rho^n for some constants c and rho. The recurrence relation becomes rho^2 = rho + 1, with possible values of rho being phi and 1-phi. The general solution is given as f_n = c1*phi^n + c2*(1-phi)^n, where phi is the golden ratio. The book suggests this method for finding the closed form of the sequence.
  • #1
MathAmateur
67
8
See below
 
Last edited:
Physics news on Phys.org
  • #2
If you "look for" a solutions of the form [itex]f_n= \rho c^n[/itex], as your book suggests, put that into [itex]f_n= f_{n-1}+ f_{n+ 1}[/itex] you get
[tex]\rho c^n= \rho c^{n-1}+ \rho c^{n-2}[/tex]
Divide through by [itex]\rho c^{n-2}[/itex] and you get
[tex]c^{n-(n-2)}= c^{n-1-(n-2)}+ 1[/tex]
[tex]c^2= c+ 1[/tex]
so that
[tex]c^2- c- 1= 0[/itex]

Complete the square or use the quadratic formula to solve for c and then put it back into [itex]f_n= \rho c^n[/itex].
 
  • #3

Homework Statement



I need to understand a derivation of the closed form of the Fibonacci sequence.

Homework Equations


The Fibonacci sequence of course is:
[tex] f_n = f_{n-1} + f_{n-2} [/tex]

The book says the key is to look for solutions of the form

[tex] f_n = {c}{\rho}^n [/tex]

for some constants c and and [tex] \rho [/tex]. The recurrence relation
[tex] f_n = f_{n-1} + f_{n-2} [/tex]

becomes

[tex] \rho^2 = \rho + 1 [/tex].

There are two possilbe values of [tex] \rho [/tex], namely [tex] \phi [/tex] and
[tex] 1 - \phi [/tex]. The general solution to the recurrance is

[tex] f_n = c_{1} {\phi}_n+ c_{2}(1-{\phi})^n [/tex]

where [tex]\phi [/tex]is the golden ratio 1.6180339


So where did the book get this? Can anyone explain this.
 
  • #4
Thanks Halls. Now it is clear.
 

1. What is the Fibonacci sequence?

The Fibonacci sequence is a mathematical sequence in which each number is the sum of the two preceding ones, starting from 0 and 1. It is named after Leonardo Fibonacci, an Italian mathematician who introduced the sequence to Western Europe in his book Liber Abaci.

2. What is the closed form of the Fibonacci sequence?

The closed form of the Fibonacci sequence is a mathematical expression that can calculate any term in the sequence without having to go through the previous terms. It is given by the formula Fn = (φ^n - (1-φ)^n)/√5, where φ is the golden ratio (1.618...) and n is the term number.

3. How is the closed form of the Fibonacci sequence derived?

The closed form of the Fibonacci sequence can be derived using various methods, such as using generating functions, matrix exponentiation, or the Binet's formula. These methods involve using mathematical concepts such as series, geometric progressions, and the golden ratio.

4. What are the advantages of using the closed form of the Fibonacci sequence?

Using the closed form of the Fibonacci sequence has several advantages, including faster and more efficient calculation of terms, easier analysis of the sequence's properties, and the ability to extend the sequence beyond the traditional starting terms of 0 and 1.

5. Are there any limitations to using the closed form of the Fibonacci sequence?

While the closed form of the Fibonacci sequence is a powerful tool for calculating and analyzing the sequence, it does have some limitations. It may become less accurate for extremely large terms due to rounding errors, and it may not work for all variations of the Fibonacci sequence, such as when the starting terms are not 0 and 1.

Similar threads

Replies
2
Views
716
  • General Math
Replies
1
Views
268
Replies
5
Views
2K
  • Precalculus Mathematics Homework Help
Replies
4
Views
1K
Replies
28
Views
2K
Replies
3
Views
967
  • Precalculus Mathematics Homework Help
Replies
12
Views
1K
Replies
1
Views
1K
  • Precalculus Mathematics Homework Help
Replies
8
Views
1K
  • Precalculus Mathematics Homework Help
Replies
5
Views
683
Back
Top