Abstract
There are 38975 Fermat pseudoprimes (base 2) up to 1011, 101629 up to 1012 and 264239 up to 1013: we describe the calculations and give some statistics. The numbers were generated by a variety of strategies, the most important being a back-tracking search for possible prime factorisations, and the computations checked by a sieving technique.
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
Bressoud, D.M.: Factorization and primality testing. Springer, New York (1989)
Brillhart, J., Lehmer, D.H., Selfridge, J.L., Tuckerman, B., Wagstaff Jr., S.S.: Factorizations of bn±1, Contemporary mathematics, 2nd edn., vol. 22. Amer. Math. Soc., Providence RI (1988)
Cipolla, M.: Sui numeri composti p, che verificano la congruenza di Fermat aP − 1 ≡ 1 mod p. Annali di Mathematica Pura e Applicata 9, 139–160 (1904)
Koblitz, N.: A course in number theory and cryptography,Graduate Texts in Mathematics, vol. 114. Springer, New York (1987)
Lehmer, D.H.: On Fermat’s quotient, base two. Math. Comp. 36, 289–290 (1981)
Mollin, R.A. (ed.): Number theory and its applications. Kluwer Academic Publishers, Dordrecht (1989); Proceedings of the NATO Advanced Study Institute on Number Theory and Applications
Pinch, R.G.E.: The Carmichael numbers up to 1015. Math. Comp. 61, 381–391 (1993)
Pomerance, C.: On the distribution of pseudoprimes. Math. Comp. 37, 587–593 (1981)
Pomerance, C.: A new lower bound for the pseudoprime counting function, Illinois J. Maths 26, 4–9 (1982)
Pomerance, C.: Two methods in elementary analytic number theory. In: Mollin [6], Proceedings of the NATO Advanced Study Institute on Number Theory and Applications
Pomerance, C., Selfridge, J.L., Wagstaff Jr., S.S.: The pseudoprimes up to 25.109. Math. Comp. 35(151), 1003–1026 (1980)
Ribenboim, P.: The little book of big primes. Springer, New York (1991)
Ribenboim, P.: The new book of prime number records, 3rd edn. Springer, New York (1996)
Riesel, H.: Prime numbers and computer methods for factorization, 2nd edn. Progress in mathematics, vol. 126. Birkhauser, Boston (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pinch, R.G.E. (2000). The Pseudoprimes up to 1013 . In: Bosma, W. (eds) Algorithmic Number Theory. ANTS 2000. Lecture Notes in Computer Science, vol 1838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722028_30
Download citation
DOI: https://doi.org/10.1007/10722028_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67695-9
Online ISBN: 978-3-540-44994-2
eBook Packages: Springer Book Archive