Authors and affiliations
J. V. Leyendekkers
The University of Sydney, 2006 Australia
A. G. Shannon
Warrane College, Kensington, NSW 1465,
& KvB Institute of Technology, North Sydney, NSW 2060, Australia
Modular rings are used to analyse integers of the form N = 2m +1. When m is odd, the integer structure prevents the formation of primes. When m is even, N ‘commonly’ has a right-end-digit of 5 and so is not a prime then. However, a sequence defined by m = 4 + 4q, q = 0, 1, 2, 3, can generate some primes as the right-end-digit is 7. Elements of this sequence satisfy the non-linear recurrence relation Gm = G2m–1 – 2Gm–1 + 2. Fermat numbers, where m = 2n satisfy this recurrence relation. However, in this case, the integer structure reveals that primes are limited to n < 5.
- John H Conway & Richard K Guy, The Book of Numbers. New York: Copernicus,
- L. Euler, Opera Omnia. Leipzig: Teubner, 1911.
- G.H. Hardy & E.M. Wright, An Introduction to the Theory of Numbers. 3rd edition. London & New York: Oxford University Press, 1954.
- Roald Hoffmann. Why Buy That Theory? American Scientist, 91(1) (2003): 9-11.
- J.V. Leyendekkers, J.M. Rybak & A.G. Shannon, Integer Class Properties Associated with an Integer Matrix. Notes on Number Theory & Discrete Mathematics. 1 (2) (1995): 53-59.
- J.V. Leyendekkers, J.M. Rybak & A.G. Shannon, Analysis of Diophantine Properties Using Modular Rings with Four and Six Classes. Notes on Number Theory & Discrete Mathematics. 3 (2) (1997): 61-74.
- J.V. Leyendekkers, J.M. Rybak & A.G. Shannon, The Characteristics of Primes and Other Integers within the Modular Ring 4 Z and in Class 14 . Notes on Number Theory & Discrete Mathematics. 4 (1) (1998): 1-17.
- J.V. Leyendekkers & A.G. Shannon, The Analysis of Twin Primes within 6 Z . Notes on Number Theory & Discrete Mathematics. 7(4) (2001): 115-124.
- J.V. Leyendekkers & A.G. Shannon, Using Integer Structure to Count the Number of Primes in a Given Interval, Notes on Number Theory & Discrete Mathematics. In press.
- Piergiorgio Odifreddi. The Mathematical Century. (Translated by Arturo Sangalli;
foreword by Freeman Dyson.) Princeton: Princeton University Press, 2004.
- Hans Riesel. Prime Numbers and Computer Methods for Factorization. 2nd edition. Progress in Mathematics, Volume 126. Boston: Birkhäuser, 1994.
Cite this paperAPA
Leyendekkers, J. V., and Shannon, A. G. (2005). Fermat’s theorem on binary powers. Notes on Number Theory and Discrete Mathematics, 11(2), 13-22.Chicago
Leyendekkers, JV, and AG Shannon. “Fermat’s Theorem on Binary Powers.” Notes on Number Theory and Discrete Mathematics 11, no. 2 (2005): 13-22.MLA
Leyendekkers, JV, and AG Shannon. “Fermat’s Theorem on Binary Powers.” Notes on Number Theory and Discrete Mathematics 11.2 (2005): 13-22. Print.