Fibonacci sequence: Difference between revisions
Quantum leap (talk | contribs) added binet's formula, recursion |
Quantum leap (talk | contribs) No edit summary |
||
| Line 3: | Line 3: | ||
'''Binet's formula''' is an explicit formula used to find any nth term. | '''Binet's formula''' is an explicit formula used to find any nth term. | ||
It is <math>\frac{1}{\sqrt{5}} | It is <math>\frac{1}{\sqrt{5}}((\frac{1+\sqrt{5}}{2})^n-(\frac{1-\sqrt{5}}{2})^n)</math> | ||
Revision as of 16:12, 20 June 2006
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 
