Dual View Random Solved Random Open
OPEN This is open, and cannot be resolved with a finite computation.
Let $c>0$. If $x$ is sufficiently large then does there exist $n\leq x$ such that the values of $\phi(n+k)$ are all distinct for $1\leq k\leq (\log x)^c$, where $\phi$ is the Euler totient function?
Disclaimer: The open status of this problem reflects the current belief of the owner of this website. There may be literature on this problem that I am unaware of, which may partially or completely solve the stated problem. Please do your own literature search before expending significant effort on solving this problem. If you find any relevant literature not mentioned here, please add this in a comment.
Erdős, Pomerenace, and Sárközy [EPS87] proved that if $\phi(n+k)$ are all distinct for $1\leq k\leq K$ then\[K \leq \frac{n}{\exp(c(\log n)^{1/3})}\]for some constant $c>0$.

See [945] for the analogous problem with the divisor function.

View the LaTeX source

External data from the database - you can help update this
Formalised statement? Yes
Related OEIS sequences: Possible
Likes this problem Alfaiz
Interested in collaborating None
Currently working on this problem None
This problem looks difficult None
This problem looks tractable None

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 #1004, https://www.erdosproblems.com/1004, accessed 2026-01-16