Popular subsets for Euler's \(\varphi \)-function (Q2423413)

For any integer $m$, let $N(m)$ be the number of solutions of the equation $\varphi(n)=m$, where $\varphi$ is the Euler $\varphi$-function. The author establishes average upper bounds for this quantity. He shows in particular that \[ \sum_{m\le x} N(m)^2 \ll x^2 / L(x)^{2-\varepsilon} \] for any positive $\varepsilon$ and where $L(x)=\exp(\log x \cdot \log_3x /\log_2x)$. This result has been conditionally shown to be optimal by \textit{C. Pomerance} [Mathematika 27, 84--89 (1980; Zbl 0437.10001)]. \par As a consequence of the main claim, the author proves that, for almost all integer $n$, the number $C(n)$ of solutions to the equation $\varphi(n')=\varphi(n)$ satisfies $C(n)\ll L^*(n)^{\frac12+\varepsilon}$ where $L^*(n)=\exp((\log_2 x)^2\log_3 x)$. This result is optimal.