Article contents
Fibonacci periods and multiples
Published online by Cambridge University Press: 08 February 2018
Extract
The well-known Fibonacci numbers Fn are defined by the recurrence relation
Fn = Fn – 1 + Fn – 2. (1)
together with the starting values F0 = 0, F1 = 1, or equivalently F1 = F2 = 1.
We record the first few:
The recurrence relation can also be applied backwards in the form Fn = Fn + 2 – Fn + 1 to define Fn for n < 0. An easy induction verifies that F−n = (−1)n – 1Fn for n > 0.
- Type
- Articles
- Information
- Copyright
- Copyright © Mathematical Association 2018
References
- 2
- Cited by