Lehmer's totient problem: Is there a composite solution to φ(n) | n-1?
4
64
Ṁ79Ṁ130
2031
27%
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?
Get Ṁ200 play money
More related questions
Related questions
Is Carmichael's totient conjecture true?
83% chance
Are there any odd noncototients?
11% chance
Is there any odd harmonic divisor number (aside from 1)?
21% chance
Does a perfect Euler brick exist?
45% chance
Is Integer Factorization in P?
20% chance
Is Toeplitz's conjecture (inscribed square problem) true?
80% chance
Is the (n,k)-Besicovitch conjecture true?
72% chance
Could Fermat have had a proof of Fermat's Last Theorem?
17% chance
Is the Euler-Mascheroni constant transcendental?
80% chance
Is the Euler-Mascheroni constant irrational?
90% chance