Lehmer's totient problem: Is there a composite solution to φ(n) | n-1?
Basic
5
Ṁ832031
30%
chance
1D
1W
1M
ALL
Let φ(n) be the Euler totient function, i.e., the number of integers less than n that are relatively prime to n. Are there any composite numbers n such that φ(n) divides n-1?
This question is managed and resolved by Manifold.
Get
1,000
and3.00