The converse of Fermat's little theorem is also known as Lehmer's theorem. It states that, if an
integer x is prime to m and
and there is no integer 
for which
,
Fermat's Little Theorem, Pratt Certificate, Primality Certificate, Witness
Riesel, H. Prime Numbers and Computer Methods for Factorization, 2nd ed. Boston, MA: Birkhäuser, p. 96, 1994.
Wagon, S. Mathematica in Action. New York: W. H. Freeman, pp. 278-279, 1991.
Eric W. Weisstein. "Fermat's Little Theorem Converse."
From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/FermatsLittleTheoremConverse.html
 |
|||
|
|
||
© 1999 CRC Press LLC,
© 1999-2005 Wolfram Research, Inc.