Difference between revisions of "Fermat's Little Theorem"
Jump to navigation
Jump to search
(New page: Fermat's Little Theorem is this: :if p is prime and b < p, then b<sup>(p-1)</sup> = 1(mod p). category:mathematics) |
(undeadend) |
||
| Line 1: | Line 1: | ||
| − | Fermat's Little Theorem is this: | + | [[Fermat]]'s Little Theorem is this: |
:if p is prime and b < p, then b<sup>(p-1)</sup> = 1(mod p). | :if p is prime and b < p, then b<sup>(p-1)</sup> = 1(mod p). | ||
[[category:mathematics]] | [[category:mathematics]] | ||
Revision as of 16:05, September 5, 2007
Fermat's Little Theorem is this:
- if p is prime and b < p, then b(p-1) = 1(mod p).