Pepin's test
(another Prime Pages' Glossary entries)
The Prime Glossary
Glossary: Prime Pages: Top 5000: 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):
Pepin's Test
Let Fn be a Fermat number. Fn is prime if and only if 3(Fn-1)/2 = -1 (mod Fn).
Here 3 can be replaced by any positive integer k for which the Jacobi symbol (k|Fn) is -1. These include k=3, 5, and 10.

If Fn is prime, this primality can be shown by Pepin's test, but when Fn 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 F14 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 © 1999-2014 (all rights reserved)