Difference between revisions of "Fibonacci sequence"
Quantum leap (talk | contribs) |
Quantum leap (talk | contribs) (added binet's formula, recursion) |
||
| Line 1: | Line 1: | ||
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 <math>1,1,2,3,5,8,13,21,34,55,...</math>. Ratios between successive terms, <math>\frac{1}{1}</math>, <math>\frac{2}{1}</math>, <math>\frac{3}{2}</math>, <math>\frac{5}{3}</math>, <math>\frac{8}{5}</math>, tend towards the limit [[phi]]. | 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 <math>1,1,2,3,5,8,13,21,34,55,...</math>. Ratios between successive terms, <math>\frac{1}{1}</math>, <math>\frac{2}{1}</math>, <math>\frac{3}{2}</math>, <math>\frac{5}{3}</math>, <math>\frac{8}{5}</math>, tend towards the limit [[phi]]. | ||
| + | The Fibonacci sequence can be written recursively as <math>F_n=F_{n-1}+F_{n-2}</math>. | ||
| + | |||
| + | '''Binet's formula''' is an explicit formula used to find any nth term. | ||
| + | It is <math>\frac{1}{\sqrt{5}}\left((\frac{1+\sqrt{5}}{2})^n-(\frac{1-\sqrt{5}}{2})^n)</math> | ||
Revision as of 17:11, 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 $\frac{1}{\sqrt{5}}\left((\frac{1+\sqrt{5}}{2})^n-(\frac{1-\sqrt{5}}{2})^n)$ (Error compiling LaTeX. Unknown error_msg)
