Difference between revisions of "Binet's Formula"
m (Change lowercase f to uppercase F when F represents finding a Fibonacci number, to make this page consistent (the introduction uses uppercase F).) |
(→Proof) |
||
Line 28: | Line 28: | ||
We note that<cmath>x^n=F_nx+F_{n-1}.</cmath>Let the roots of our original quadratic be <math>\sigma=\frac{1+\sqrt 5}{2}</math> and <math>\tau=\frac{1-\sqrt 5}{2}.</math> Since both <math>\sigma</math> and <math>\tau</math> are roots of the quadratic, they must both satisfy <math>x^n=F_nx+F_{n-1}.</math> So<cmath>\sigma^n=F_n\sigma+F_{n-1}</cmath>and<cmath>\tau^n=F_n\tau+F_{n-1}.</cmath>Subtracting the second equation from the first equation yields<cmath> | We note that<cmath>x^n=F_nx+F_{n-1}.</cmath>Let the roots of our original quadratic be <math>\sigma=\frac{1+\sqrt 5}{2}</math> and <math>\tau=\frac{1-\sqrt 5}{2}.</math> Since both <math>\sigma</math> and <math>\tau</math> are roots of the quadratic, they must both satisfy <math>x^n=F_nx+F_{n-1}.</math> So<cmath>\sigma^n=F_n\sigma+F_{n-1}</cmath>and<cmath>\tau^n=F_n\tau+F_{n-1}.</cmath>Subtracting the second equation from the first equation yields<cmath> | ||
This yields the general form for the nth Fibonacci number:<cmath>\boxed{F_n = \frac{\left(\frac{1+\sqrt 5}{2}\right)^n - \left(\frac{1-\sqrt 5}{2}\right)^n}{\sqrt 5}}</cmath> | This yields the general form for the nth Fibonacci number:<cmath>\boxed{F_n = \frac{\left(\frac{1+\sqrt 5}{2}\right)^n - \left(\frac{1-\sqrt 5}{2}\right)^n}{\sqrt 5}}</cmath> | ||
+ | |||
+ | |||
+ | ==Proof using Recursion== | ||
+ | The Fibonacci recursive relation is <math>F_n = F_{n-1} + F_{n-2}.</math> This is a constant coefficient linear homogenous recurrence relation. We also know that <math>F_0 = 0</math> and <math>F_1 = 1.</math> Thus, it’s characteristic equation is <math>x^2-x-1=0</math> which has solutions <cmath>\frac{1\pm\sqrt{5}}{2}.</cmath>Let <math>v= \frac{1+\sqrt{5}}{2}</math> and <math>p= \frac{1-\sqrt{5}}{2}.</math> We get that <cmath>F_n = \lambda_1 v^n + \lambda_2 p^n.</cmath>Plugging in our initial conditions, we get | ||
+ | ~peelybonehead | ||
==See Also== | ==See Also== | ||
*[[Fibonacci number]] | *[[Fibonacci number]] | ||
[[Category:Theorems]] | [[Category:Theorems]] |
Revision as of 17:48, 19 May 2023
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.
Contents
[hide]Formula
If is the th Fibonacci number, then .
Proof
To derive a general formula for the Fibonacci numbers, we can look at the interesting quadraticBegin by noting that the roots of this quadratic are according to the quadratic formula. This quadratic can also be written as From this, we can write expressions for all : We note thatLet the roots of our original quadratic be and Since both and are roots of the quadratic, they must both satisfy SoandSubtracting the second equation from the first equation yields This yields the general form for the nth Fibonacci number:
Proof using Recursion
The Fibonacci recursive relation is This is a constant coefficient linear homogenous recurrence relation. We also know that and Thus, it’s characteristic equation is which has solutions Let and We get that Plugging in our initial conditions, we get