## Fermat's little theoremIf P is a prime number then for
any number a, (a - ^{P}a) must be divisible
by P. This theorem is useful for testing if a number is not prime,
though it can't tell if a number is prime. As was his habit, Pierre de Fermat
didn't provide a proof (this time saying "I would send you the demonstration,
if I did not fear its being too long"). Leonhard Euler
first published a proof in 1736, but Gottfried Leibniz
left virtually the same proof in an unpublished manuscript from sometime
before 1683. ## Related category• PRIME NUMBERS | |||||

Home • About • Copyright © The Worlds of David Darling • Encyclopedia of Alternative Energy • Contact |