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.
Get Ṁ200 play money
Related questions
Is Hadwiger's conjecture true?
56% chance
Is the Jacobian conjecture true?
76% chance
Is the four exponentials conjecture true?
85% chance
Is Goodman's Conjecture true?
71% chance
Is Schanuel's conjecture true?
78% chance
Is Rudin's conjecture true?
69% chance
Is Smale's Mean Value conjecture true?
66% chance
Is the strong Rudin's conjecture true?
64% chance
Is Haborth's Conjecture true?
70% chance
Is de Polignac's conjecture true?
87% chance