OPEN
This is open, and cannot be resolved with a finite computation.
Let $V(x)$ count the number of $n\leq x$ such that $\phi(m)=n$ is solvable. Does $V(2x)/V(x)\to 2$? Is there an asymptotic formula for $V(x)$?
Pillai
[Pi29] proved $V(x)=o(x)$. Erdős
[Er35b] proved $V(x)=x(\log x)^{-1+o(1)}$.
The behaviour of $V(x)$ is now almost completely understood. Maier and Pomerance
[MaPo88] proved\[V(x)=\frac{x}{\log x}e^{(C+o(1))(\log\log\log x)^2},\]for some explicit constant $C>0$. Ford
[Fo98] improved this to\[V(x)\asymp\frac{x}{\log x}e^{C_1(\log\log\log x-\log\log\log\log x)^2+C_2\log\log\log x-C_3\log\log\log\log x}\]for some explicit constants $C_1,C_2,C_3>0$. Unfortunately this falls just short of an asymptotic formula for $V(x)$ and determining whether $V(2x)/V(x)\to 2$.
In
[Er79e] Erdős asks further to estimate the number of $n\leq x$ such that the smallest solution to $\phi(m)=n$ satisfies $kx<m\leq (k+1)x$.
See also
[417] and
[821].
This is discussed in problem B36 of Guy's collection
[Gu04].
View the LaTeX source
This page was last edited 30 September 2025.
Additional thanks to: Kevin Ford
When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:
T. F. Bloom, Erdős Problem #416, https://www.erdosproblems.com/416, accessed 2026-01-16