Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-23T11:06:32.462Z Has data issue: false hasContentIssue false
  • English
  • Français

Fibonacci periods and multiples

Published online by Cambridge University Press:  08 February 2018

G. J. O. Jameson
G. J. O. Jameson*
Affiliation:
Dept. of Mathematics and Statistics, Lancaster University, Lancaster LA1 4YF e-mail: g.jameson@lancaster.ac.uk
Get access Rights & Permissions [Opens in a new window]

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
The Mathematical Gazette , Volume 102 , Issue 553 , March 2018 , pp. 63 - 76
Copyright
Copyright © Mathematical Association 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Vajda, Steven, Fibonacci and Lucas numbers and the Golden Section, Dover (1989).Google Scholar
2. Koshy, Thomas, Fibonacci and Lucas numbers with Applications, Wiley Interscience, New York (2001).Google Scholar
3. Lucas, E., Théorie des fonctions numériques simplement périodiques, American J. Math. 1 (1878) pp. 184–240, 289-321.Google Scholar
4. Wall, D. D., Fibonacci series modulo m , American Math. Monthly 67 (1960) pp. 525–532.Google Scholar
5. Vinson, John, The relation of the period modulo m to the rank of apparition of m in the Fibonacci sequence, Fibonacci Quart. 1 (2) (1963) pp. 37–45.Google Scholar
6. Robinson, D. W., The Fibonacci matrix modulo m , Fibonacci Quart. 1 (2) (1963) pp. 29–36.Google Scholar
7. Halton, John H., On the divisibility properties of Fibonacci numbers, Fibonacci Quart. 4 (1966) pp. 217–240.Google Scholar
8. Brown, Kevin, The period of Fibonacci sequences modulo m, solution to Problem E3410, American Math. Monthly 99 (1992) pp. 278–279.Google Scholar
9. Jaroma, John H., On a generalised divisibility property of primes and the Fibonacci numbers, Math. Gaz. 87 (2003) pp. 486–491.Google Scholar
10. Vella, Dominic and Vella, Alfred, Some properties of finite Fibonacci sequences, Math. Gaz. 88 (2004) pp. 494–500.Google Scholar
11. Hardy, G. H. and Wright, E. M., An Introduction to the theory of Numbers (5th edn.), Oxford University Press (1979).Google Scholar