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.