Fermat's little theorem

Given a prime number and number , then and . #m/thm/num

Proof

Let where , so , and it suffices to show . Then , and since the order of an element divides the order of a group, .

#state/tidy | #lang/en | #SemBr