Lehmer's totient problem: Is there a composite solution to φ(n) | n-1?
Mini
5
Ṁ86
2031
30%
chance

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?

#Math
Get Ṁ1,000 play money
Comments

Related questions