
Glossary: Prime Pages: Top 5000: 
The hardware and software on this system was updated September 4th.
Please let me know of any problem you encounter.
<caldwell@utm.edu> In 1877 Pepin proved the following theorem for deciding if Fermat numbers are prime (this is one of the nicest examples of the classical primality proving tests):
If F_{n} is prime, this primality can be shown by Pepin's test, but when F_{n} is composite, Pepin's test does not tell us what the factors will be (only that it is composite). For example, Selfridge and Hurwitz showed that F_{14} was composite in 1963, but we still do not know any of its divisors.
See Also: Fermats, FermatDivisor Related pages (outside of this work) Chris K. Caldwell © 19992014 (all rights reserved)
