Codex Wiki
OurBigBook.com
Site
Source code
Finite fibres of the Euler totient function
Home
Mathematics
Area of mathematics
Number theory
Euler totient function
OurBigBook.com
Words: 35
For each positive integer
k
, only finitely many
n
satisfy
φ
(
n
)
=
k
. Indeed, every prime
p
∣
n
has
p
−
1
∣
k
, and the exponent of
p
in
n
is bounded because
p
a
−
1
∣
k
.
Ancestors
(5)
Euler totient function
Number theory
Area of mathematics
Mathematics
Home
Incoming links
(1)
Solution