5313 shaares
127 private links
127 private links
The Fibonacci numbers are the sequence 1, 1, 2, 3, 5, 8, ..., and satisfy the recurrence F(n) = F(n – 1) + F(n – 2).
They also have a beautiful formula.
My favorite derivation of this formula entirely avoids algebraic manipulation.
