Abstract

Recall that Fermat’s “little theorem ” says that if p is prime and a is not a multiple of p, then ap−1 ≡ 1 mod p. This theorem gives a possible way to detect primes, or more exactly, non-primes: if for a certain a coprime to n, an−1 is not congruent to 1 mod n, then, by the theorem, n is not

Citations

160	A Course in Number Theory and Cryptography - Koblitz - 1994
119	Prime Numbers - A Computational Perspective - Crandall, Pomerance - 2000
61	There are infinitely many Carmichael numbers - Alford, Granville, et al. - 1994
10	On composite numbers P which satisfy the Fermat congruence a P \Gamma1 j 1 (mod P - Carmichael - 1912
6	On the number of Carmichael numbers up to x - Harman
3	numbers with three prime factors - Heath-Brown, Carmichael
1	numbers with three prime factors, at www.maths.lancs.ac.uk/~jameson 24 G.A - Jameson, Carmichael - 1998
1	The Carmichael numbers up to 10 18 , at www.chalcedon.demon.co.uk/rgep/carpsp.html [Pom1] Carl Pomerance, The distribution of pseudoprimes - Pinch - 1988