Beta Phase:
Square45 is currently in beta testing. Expect some features or content to be incomplete or missing.
45
English
Français
العربية
Deutsch
🏠
/
Mathematics
/
Elementary Number Theory
/
Fermat's Little Theorem
Fermat's Little Theorem
Crucial for primalit testing and cryptography.
📜
The statement of the theorem
If
p
p
p
is a prime number, then for any integer
a
a
a
, the number
a
p
−
a
a^p - a
a
p
−
a
is an integer multiple of
p
p
p
.\n
a
p
≡
a
(
m
o
d
p
)
a^p \equiv a \pmod{p}
a
p
≡
a
(
mod
p
)
Source: Wikipedia