Difference between revisions of "Fibonacci sequence"
(link,stubbed) |
|||
| Line 1: | Line 1: | ||
| − | The '''Fibonacci sequence''' is a | + | The '''Fibonacci sequence''' is a [[sequence]] of [[integer]]s in which the first and second term are both equal to 1 and each subsequent term is the sum of the two preceding it. The first few terms are <br><math>1, 1, 2, 3, 5, 8, 13, 21, 34, 55,...</math>. |
| − | The Fibonacci sequence can be written recursively as <math>F_n=F_{n-1}+F_{n-2}</math>. | + | The Fibonacci sequence can be written [[recursion|recursively]] as <math>F_n=F_{n-1}+F_{n-2}</math>. |
Revision as of 15:32, 29 June 2006
The Fibonacci sequence is a sequence of integers in which the first and second term are both equal to 1 and each subsequent term is the sum of the two preceding it. 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 
This article is a stub. Help us out by expanding it.
