Derivation of Fibonacci closed form

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
3 replies · 4K views
MathAmateur
Messages
67
Reaction score
8
See below
 
Last edited:
Physics news on Phys.org
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]<br /> <br /> 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].[/tex]
 

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.
 
Thanks Halls. Now it is clear.