🔢
Fermat's Little Theorem
★★★★☆Undergraduate
📖Definition
If p is prime and a is not divisible by p, then a^(p-1) ≡ 1 (mod p).
📐Formulas
a^p-1 ≡ 1 ±odp
Fermat's Little Theorem
a^p ≡ a ±odp
Fermat's Little Theorem (variant)
✏️Examples
예제 1
Find 2^10 mod 11 using Fermat's Little Theorem.
예제 2
Find 3^100 mod 7.
📜History
Discovered by: Pierre de Fermat (1640)
First mentioned in a letter to Mersenne; proved by Euler.
⚡Applications
Cryptography
RSA, primality testing
Algorithms
Fast exponentiation
🔗Related Documents
→Prerequisites
←Next Topics
↔Related
#페르마#소정리#Fermat#little theorem