Difference between revisions of "Fermat's Little Theorem"
Jump to navigation
Jump to search
DavidB4-bot (talk | contribs) (→top: clean up & uniformity) |
|||
| Line 2: | Line 2: | ||
: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]] |
Revision as of 12:24, July 13, 2016
Fermat's Little Theorem (so called to distinguish it from Fermat's Last Theorem) is this:
- if p is prime and b < p, then b(p-1) = 1(mod p).