Rare card

Proofs of Fermat's little theorem

Value

50 W

Attack

721

Defence

577

Players

0

This article collects together a variety of proofs of Fermat's little theorem, which states that a p ≡ a ( mod p ) {\displaystyle a^{p}\equiv a{\pmod {p}}} for every prime number p and every integer a (see modular arithmetic).

Español