Difference between revisions of "Fermat's Little Theorem"
Jump to navigation
Jump to search
DavidB4-bot (talk | contribs) (→top: clean up & uniformity) |
DavidB4-bot (talk | contribs) (clean up) |
||
| Line 1: | Line 1: | ||
| − | [[Fermat]]'s Little Theorem (so called to distinguish it from [[Fermat's Last Theorem]]) is | + | '''[[Fermat]]'s Little Theorem''' (so called to distinguish it from [[Fermat's Last Theorem]]) is that: |
| − | :if p is prime and b < p, | + | :if p is prime and b < p, than b<sup>(p-1)</sup> = 1(mod p). |
[[Category:Mathematics]] | [[Category:Mathematics]] | ||
Revision as of 02:16, August 17, 2016
Fermat's Little Theorem (so called to distinguish it from Fermat's Last Theorem) is that:
- if p is prime and b < p, than b(p-1) = 1(mod p).