The pseudoprimes to 25⋅10⁹
Carl Pomerance, J. L. Selfridge, Samuel S. Wagstaff
Source record
Source: Crossref
Published: Jan 1, 1980
DOI: 10.1090/s0025-5718-1980-0572872-7
Open original source ↗Source abstract
The odd composite n ⩽ 25 ⋅ 10 9 n \leqslant 25 \cdot {10^9} such that 2 n − 1 ≡ 1 ( mod n ) {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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.