Proofs of Fermat's little theorem

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). == Simplifications == Some of the proofs of Fermat's little theorem given below depend on two simplifications.

Source: Wikipedia — Proofs of Fermat's little theorem (CC BY-SA 4.0)

Proofs of Fermat's little theorem

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). == Simplifications == Some of the proofs of Fermat's little theorem given below depend on two simplifications.

This neuron ends here.

Source: Wikipedia "Proofs of Fermat's little theorem" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy