Hostname: page-component-8448b6f56d-m8qmq Total loading time: 0 Render date: 2024-04-17T19:59:58.877Z Has data issue: false hasContentIssue false

104.03 On periods of Fibonacci numbers using modular arithmetic on the Binet formula

Published online by Cambridge University Press:  02 March 2020

Jawad Sadek
Affiliation:
Department of Mathematics and Statistics, Northwest Missouri State University, Maryville, MO, 64468USA e-mail: jawads@nwmissouri.edu
Russell Euler
Affiliation:
Department of Mathematics and Statistics, Northwest Missouri State University, Maryville, MO, 64468USA e-mail: jawads@nwmissouri.edu

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Notes
Copyright
© Mathematical Association 2020

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

Dickson, L. E., History of the theory of numbers, vol. I, Chelses, New York (1952).Google Scholar
Wall, D. D., Fibonacci series modulo m, The American Mathematical Monthly 67 (1960) pp. 525532.CrossRefGoogle Scholar
Robinson, D. W., The Fibonacci matrix modulo m, The Fibonacci Quarterly 1 (1963) pp. 2936.Google Scholar
Renault, M., The Fibonacci sequence under various moduli, A Masters Thesis, Wake Forest University (1996).Google Scholar
Rosen, K. H., Discrete mathematics and its applications (4th edn.), McGraw-Hill, New York (1999).Google Scholar
Dence, J. P. and Dence, T. P., Elements of the theory of numbers, (1st edn.), Academic Press, New York (1999).Google Scholar
Lowry, D., Unexpected conjectures about −5 modulo prime, The College Mathematics Journal 46 (1) (2015) pp. 5657.CrossRefGoogle Scholar