Carmichael numbers

(0.002 seconds)

3 matching pages

1: 27.12 Asymptotic Formulas: Primes

… ►Descriptions and comparisons of pseudoprime tests are given in Bressoud and Wagon (2000, §§2.4, 4.2, and 8.2) and Crandall and Pomerance (2005, §§3.4–3.6). ►A Carmichael number is a composite number

n

for which

b^{n}\equiv b\pmod{n}

for all

b\in\mathbb{N}

. There are infinitely many Carmichael numbers. …

2: Bibliography

… ►

W. R. Alford, A. Granville, and C. Pomerance (1994) There are infinitely many Carmichael numbers. Ann. of Math. (2) 139 (3), pp. 703–722.

ⓘ

External Links:: ISSN 0003-486X, FullText, MathReview (H. L. Montgomery), ZentralBlatt
Referenced by:: §27.12.
Encodings:: BibTeX

…

3: Bibliography L

… ►

D. H. Lehmer (1941) Guide to Tables in the Theory of Numbers. Bulletin of the National Research Council, No. 105, National Research Council, Washington, D.C..

ⓘ

Notes:: Reprinted in 1961.
External Links:: MathReview (R. D. Carmichael), ZentralBlatt
Referenced by:: §27.20, §27.20, §27.21, §27.21.
Encodings:: BibTeX

…