Abstract
We have reduced the problem of finding even perfect numbers to deciding when M(p) = 2P — 1 is prime. Algorithm 2.9 is a very recent development. In this chapter we will be starting with some progress made by Pierre de Fermat (1601-1665) in 1640.
“I have found a very great number of exceedingly beautiful theorems.”
- Pierre de Fermat
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. D. Carmichael, “Note on a New Number Theory Function,” Bull. Am. Math. Soc., 16(1909-1910), 232–238.
R. D. Carmichael, “On composite numbers P which satisfy the Fermat congruence AP-1 ≡ 1 mod P,” Am. Math. Monthly, 19(1912), 22–27.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Bressoud, D.M. (1989). Fermat, Euler, and Pseudoprimes. In: Factorization and Primality Testing. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4544-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4544-5_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8871-8
Online ISBN: 978-1-4612-4544-5
eBook Packages: Springer Book Archive