Fermat's little theorem
mathematical theorem that, for any prime 𝑝, the 𝑝th power of any integer 𝑛 is congruent to 𝑛 modulo 𝑝
AI overview
Fermat's Little Theorem states that if you take any whole number, raise it to the power of a prime number p, the result will leave the same remainder as the original number when divided by p. This theorem is fundamental in number theory and has practical applications in cryptography and computer security.
AI-generated from the Wikipedia summary — may contain errors.
Wikidata facts
- Image
- Fermatp.PNG
Sources (3)
via Wikidata · CC0
Article
In number theory, Fermat's little theorem states that if p is a prime number, then for any integer a, the number a − a is an integer multiple of p. In the notation of modular arithmetic, this is expressed as
a