Difference between revisions of "Fibonacci sequence"
m (reorganized a bit) |
(→Intermediate: Made binet LaTeX prettier) |
||
| Line 12: | Line 12: | ||
'''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}}((\frac{1+\sqrt{5}}{2})^n-(\frac{1-\sqrt{5}}{2})^n)</math> | + | It is <math>\frac{1}{\sqrt{5}}\left(\left(\frac{1+\sqrt{5}}{2}\right)^n-\left(\frac{1-\sqrt{5}}{2}\right)^n\right)</math> |
Revision as of 17:22, 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 
.
The Fibonacci sequence can be written recursively as 
.
Introduction
Ratios between successive terms, 
, 
, 
, 
, 
, tend towards the limit phi.
Intermediate
Binet's formula is an explicit formula used to find any nth term.
It is 
