Is Carmichael's totient conjecture true?
Basic
2
Ṁ602101
83%
chance
1D
1W
1M
ALL
Carmichael's totient conjecture states that for every number n, there is another number m such that φ(n) = φ(m), where φ is the totient function (the number of positive integers less than n that are coprime to n). In other words, every value in the image of the totient function is the totient of at least two distinct numbers.
This question is managed and resolved by Manifold.
Get
1,000
and3.00
Related questions
Related questions
Is Hadwiger's conjecture true?
58% chance
Is Schanuel's conjecture true?
78% chance
Is Haborth's Conjecture true?
70% chance
Is the Jacobian conjecture true?
76% chance
Is the Unique Games Conjecture true?
65% chance
Is Beal's conjecture true?
60% chance
Is the 1/3–2/3 conjecture true?
78% chance
Is Goodman's Conjecture true?
71% chance
Conditional on Goldbach's conjecture being false, is Oldbach's conjecture true?
46% chance
Lehmer's totient problem: Is there a composite solution to φ(n) | n-1?
30% chance