# The Pseudoprimes to $25 \cdot 10^9$

Carl Pomerance, J. L. Selfridge and Samuel S. Wagstaff, Jr.
Mathematics of Computation
Vol. 35, No. 151 (Jul., 1980), pp. 1003-1026
DOI: 10.2307/2006210
Stable URL: http://www.jstor.org/stable/2006210
Page Count: 24

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

Preview not available

## Abstract

The odd composite $n \leqslant 25 \cdot 10^9$ such that $2^{n-1} \equiv 1 (\operatorname{mod 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 Erdos 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.

• 1003
• 1004
• 1005
• 1006
• 1007
• 1008
• 1009
• 1010
• 1011
• 1012
• 1013
• 1014
• 1015
• 1016
• 1017
• 1018
• 1019
• 1020
• 1021
• 1022
• 1023
• 1024
• 1025
• 1026