# Difference between revisions of "Fermat's Little Theorem"

From Conservapedia

(undeadend) |
|||

Line 1: | Line 1: | ||

− | [[Fermat]]'s Little Theorem is this: | + | [[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<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 19:39, October 5, 2009

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).