Fermat's little theorem
For a prime p, a^p is congruent to a modulo p; if p does not divide a, a^(p−1) is congruent to1 modulo p. The converse fails.
atlas-fermat-little-theorem · canonical_mko
This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.
Catalogue presentation and source-binding data
For a prime p, a^p is congruent to a modulo p; if p does not divide a, a^(p−1) is congruent to1 modulo p. The converse fails.
atlas-fermat-little-theorem · canonical_mko