The terms in a Fibonacci sequence obey the recursive rule Fn+2= Fn+1+ Fn. One common way of solving such equations is to try a solution of the form Fn= an. Then Fn+1= an+1 and Fn+2= an+2 so the equation becomes an+2= an+1+ an. Dividing by an gives a2= a+ 1 or a2- a- 1= 0. Solving that by the quadratic formula,
[tex]a= \frac{1\pm\sqrt{5}}{2}[/tex]
In other words,
[tex]F_n= \left(\frac{1+\sqrt{5}}{2}\right)^n[/tex]
and
[tex]F_n= \left(\frac{1-\sqrt{5}}{2}\right)^n[/tex]
both satisfy Fn+2= Fn+1+ Fn.
Since that is a linear equation, any solution of that equation can be written
[tex]A\left(\frac{1+\sqrt{5}}{2}\right)^n+ B\left(\frac{1-\sqrt{5}}{2}\right)^n[/tex]
Now, looking at the first two terms of the Fibonacci sequence
[tex]F_0= A+ B= 1[/tex]
and
[tex]F_1=A\left(\frac{1+\sqrt{5}}{2}\right)+ B\left(\frac{1-\sqrt{5}}{2}\right)= 1[/tex]
gives two equations to solve for A and B.