Fermat's little theorem gives a condition that a prime
must satisfy:
Theorem. If P is a prime, then for any number a,
( aP - a ) must be divisible by P.
Let's check:
29 - 2 = 510, is not divisible by 9, so it
cannot be prime.
35 - 3 = 240, is divisible by 5, because 5 is
prime.
Presentation Suggestions:
This may be a good time to explain the difference
between a necessary and sufficient condition.
The Math Behind the Fact:
This theorem can be used as a way to test if a number is
not prime,
although it cannot tell you if a number is prime.
How to Cite this Page:
Su, Francis E., et al. "Fermat's Little Theorem."
Mudd Math Fun Facts.
<http://www.math.hmc.edu/funfacts>.
Bookmark this page on:
|
Digg this!
|
Del.icio.us
|
Technorati
|
Reddit
|
Fark
|
Squidoo
|
Furl
|
Blinklist
|
Yahoo MyWeb
|
Google
|
Stumbleupon
|
|