A Prime always satisfies the condition that is divisible by . However, this condition is not true *exclusively* for Primes (e.g., is divisible by
). Composite
Numbers (such as 341) for which is divisible by are called Poulet Numbers, and are a special class of Fermat Pseudoprimes. The Chinese hypothesis is a special
case of Fermat's Little Theorem.

**References**

Shanks, D. *Solved and Unsolved Problems in Number Theory, 4th ed.* New York: Chelsea, pp. 19-20, 1993.

© 1996-9

1999-05-26