
Glossary: Prime Pages: Top 5000: 
The composite integer n is a Carmichael number if
a^{n1}=1 (mod n) for every integer
a relatively prime to n. (This condition is
satisfied by all primes because of Fermat's Little Theorem.)
The Fermat probable primality test will fail to show a
Carmichael number is composite until we run across one of
its factors!
The Carmichael numbers under 100,000 are 561, 1105, 1729, 2465, 2821, 6601, 8911, 10585, 15841, 29341, 41041, 46657, 52633, 62745, 63973, and 75361.Small Carmichael numbers are rare: there are only 2,163 are less than 25,000,000,000. (Recently, Richard Pinch has found that there are still only 246,683 Carmichael numbers below 10,000,000,000,000,000.) Nevertheless, in 1994 it was proved that there are infinitely many of them!
See Also: Pseudoprime, PRP Related pages (outside of this work) References:
Chris K. Caldwell © 19992014 (all rights reserved)
