Fibonacci sequence
Revision as of 16:11, 20 June 2006 by Quantum leap (talk | contribs) (added binet's formula, recursion)
The Fibonacci sequence is a series of numbers in which each number is the sum of the two preceding it (the first two terms are simply 1). The first few terms are 
. Ratios between successive terms, 
, 
, 
, 
, 
, tend towards the limit phi.
The Fibonacci sequence can be written recursively as 
.
Binet's formula is an explicit formula used to find any nth term. It is $\frac{1}{\sqrt{5}}\left((\frac{1+\sqrt{5}}{2})^n-(\frac{1-\sqrt{5}}{2})^n)$ (Error compiling LaTeX. Unknown error_msg)
