Problem
Fibonacci sequence: with , . Show (by induction or directly) that (Binet’s formula). Compute also .
Solution
Binet’s formula. and are the roots of the characteristic equation , that is . Every sequence of the form with a root satisfies the recurrence ; by linearity so does . Imposing the initial conditions: From it follows that ; since , we have , , whence Limit of the ratio. Since , the term and dominates. Hence the golden ratio.
Links
Topics: Sequences
Concepts: Limit of a sequence · Recursively defined sequence
Skills: Computing limits · Proving
People: Binet · Leonardo Fibonacci
Exercise type: Computing a limit · Proof