MathGoldMedalist
Home
Toolkit
Problems
About
Sign In
Register
Home
Toolkit
Problems
About
Home
›
Toolkit
›
Euler's Theorem
Toolkit 52
Euler's Theorem
Let
n
n
n
be a positive integer. If
gcd
(
n
,
a
)
=
1
\gcd(n,a)=1
g
cd
(
n
,
a
)
=
1
,
a
φ
(
n
)
≡
1
(
m
o
d
n
)
a^{\varphi(n)}\equiv1\pmod n
a
φ
(
n
)
≡
1
(
mod
n
)
Related Problems
Core
AMC 10B/12B 2024 (Problem 18/14)
←
Back to Toolkit