| 释义 |
pseudoprime (Carmichael number) The positive integer n is a pseudoprime if it is composite, but an ≡ a (mod n), for all integers a. Thus, Fermat's Little Theorem cannot be used to demonstrate n is not prime. The first pseudoprime is 561. It was shown in 1994 that there are infinitely many pseudoprimes.
|