Erdős problem 1004
For any fixed c > 0, if x is sufficiently large then there exists n ≤ x such that the values of φ(n+k) are all distinct for 1 ≤ k ≤ (log x)^c. This is an open problem.
Workspace
public preview
- #1004
- None
- 0
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
AI building on literature
- Machine