Erdős [Er85e] says that, presumably, for every $k\geq 1$ the equation\[\phi(n)=\phi(n+1)=\cdots=\phi(n+k)\]has infinitely many solutions.

Erdős, Pomerance, and Sárközy [EPS87] proved that the number of $n\leq x$ with $\phi(n)=\phi(n+1)$ is at most\[\frac{x}{\exp((\log x)^{1/3})}.\]See [946] for the analogous question with the divisor function, and [415] for a question about more general inequality patterns among consecutive values of $\phi$.

View the LaTeX source

This page was last edited 19 April 2026. View history