Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



The pseudoprimes to $25\cdot 10^{9}$

Authors: Carl Pomerance, J. L. Selfridge and Samuel S. Wagstaff
Journal: Math. Comp. 35 (1980), 1003-1026
MSC: Primary 10A40; Secondary 10-04, 10A25
MathSciNet review: 572872
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The odd composite $n \leqslant 25 \cdot {10^9}$ such that ${2^{n - 1}} \equiv 1\;\pmod n$ have been determined and their distribution tabulated. We investigate the properties of three special types of pseudoprimes: Euler pseudoprimes, strong pseudoprimes, and Carmichael numbers. The theoretical upper bound and the heuristic lower bound due to Erdös for the counting function of the Carmichael numbers are both sharpened. Several new quick tests for primality are proposed, including some which combine pseudoprimes with Lucas sequences.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 10A40, 10-04, 10A25

Retrieve articles in all journals with MSC: 10A40, 10-04, 10A25

Additional Information

Keywords: Pseudoprime, strong pseudoprime, Euler pseudoprime, Carmichael number, primality testing, Lucas sequence
Article copyright: © Copyright 1980 American Mathematical Society