Binet's Formula
Binet's formula is an explicit formula used to find the 
th term of the Fibonacci sequence.
It is so named because it was derived by mathematician Jacques Philippe Marie Binet, though it was already known by Abraham de Moivre.
Formula
If 
is the th Fibonacci number, then
![\[F_n=\frac{1}{\sqrt{5}}\left(\left(\frac{1+\sqrt{5}}{2}\right)^n-\left(\frac{1-\sqrt{5}}{2}\right)^n\right)\]](http://latex.artofproblemsolving.com/8/6/d/86d486c560727727342090b432e23ba85ac098b1.png)
.
Proof
[i]Written by Mathlete2017[/i]
To derive a general formula for the Fibonacci numbers, we can look at the interesting quadratic![\[x^2-x-1=0.\]](http://latex.artofproblemsolving.com/c/f/a/cfa5a22c7b55b2d1d0abf20af16e444b5c4a9961.png)
Begin by noting that the roots of this quadratic are 
according to the quadratic formula. This quadratic can also be written as![\[x^2=x+1.\]](http://latex.artofproblemsolving.com/d/2/8/d2896c78375da247be341cb6fe96e4c0566f27b2.png)
From this, we can write expressions for all 
:
We note that![\[x^n=f_nx+f_{n-1}.\]](http://latex.artofproblemsolving.com/c/e/9/ce9a0778add037e87c6fe4c64cebc5a1d3cca634.png)
Let the roots of our original quadratic be 
and 
Since both 
and 
are roots of the quadratic, they must both satisfy 
So![\[\sigma^n=f_n\sigma+f_{n-1}\]](http://latex.artofproblemsolving.com/3/d/c/3dc76be6448594fd8a892763b26477c39dd13f57.png)
and![\[\tau^n=f_n\tau+f_{n-1}.\]](http://latex.artofproblemsolving.com/0/e/8/0e84b1cfa080fdb7b7a0ff5f0f4775d16eb0f6f6.png)
Subtracting the second equation from the first equation yields\begin{align*}\sigma^n-\tau^n=f_n(\sigma-\tau)+f_{n-1}-f_{n-1} \\ \left(\frac{1+\sqrt 5}{2}\right)^n - \left(\frac{1-\sqrt 5}{2}\right)^n = f_n \left(\frac{1+\sqrt 5}{2} - \frac{1-\sqrt 5}{2}\right)\end{align*}
This yields the general form for the n[sup]th[/sup] Fibonacci number:![\[\boxed{f_n = \frac{\left(\frac{1+\sqrt 5}{2}\right)^n - \left(\frac{1-\sqrt 5}{2}\right)^n}{\sqrt 5}}\]](http://latex.artofproblemsolving.com/8/f/b/8fb1994632f304bcb807c88ed5086904c83e7efa.png)
