The distribution of totients

This paper is an announcement of many new results concerning the set of totients, i.e. the set of values taken by Euler’s ϕ \phi -function. The main functions studied are V ( x ) V(x) , the number of totients not exceeding x x , A ( m ) A(m) , the number of solutions of ϕ ( x ) = m \phi (x)=m (the “multiplicity” of m m ), and V k ( x ) V_{k}(x) , the number of m ≤ x m\le x with A ( m ) = k A(m)=k . The first of the main results of the paper is a determination of the true order of V ( x ) V(x) . It is also shown that for each k ≥ 1 k\ge 1 , if there is a totient with multiplicity k k , then V k ( x ) ≫ V ( x ) V_{k}(x) \gg V(x) . We further show that every multiplicity k ≥ 2 k\ge 2 is possible, settling an old conjecture of Sierpiński. An older conjecture of Carmichael states that no totient has multiplicity 1. This remains an open problem, but some progress can be reported. In particular, the results stated above imply that if there is one counterexample, then a positive proportion of all totients are counterexamples. Determining the order of V ( x ) V(x) and V k ( x ) V_{k}(x) also provides a description of the “normal” multiplicative structure of totients. This takes the form of bounds on the sizes of the prime factors of a pre-image of a typical totient. One corollary is that the normal number of prime factors of a totient ≤ x \le x is c log ⁡ log ⁡ x c\log \log x , where c ≈ 2.186 c\approx 2.186 . Lastly, similar results are proved for the set of values taken by a general multiplicative arithmetic function, such as the sum of divisors function, whose behavior is similar to that of Euler’s function.