Binet's formula: Fibonacci numbers in closed form
Need a hint?
Look for solutions of the form xāæ of Fā = Fāāā + Fāāā. That gives x² = x + 1.
Binet's formula gives Fāā = 55 as the nearest integer to Ϲā°/ā5 ā 55.0036.
How to work it out
Try in . Dividing by gives , with roots and . So any combination satisfies the recurrence.
Match and : and , so (since ):
(1)Since , the second term is tiny, and is the nearest whole number to . For : , divided by that is :
(2)
LaTeX source of the formulas on this page
\[ F_{10}=55 \]
\[ F_n=\frac{\varphi^n-\psi^n}{\sqrt5} \]Questions
What is the answer to: Binet's formula: Fibonacci numbers in closed form?
Binet's formula gives Fāā = 55 as the nearest integer to Ϲā°/ā5 ā 55.0036.
What is the key idea?
A linear recurrence is solved by powers of the roots of its characteristic equation.
Is there a hint?
Look for solutions of the form xāæ of Fā = Fāāā + Fāāā. That gives x² = x + 1.