Erdős Problem #681 — Is it true that for all large n there exists k such that n+k is composite and p(n+k)>k^2, where p(m) is the least prime factor of m?
Statement
Is it true that for all large there exists such that is composite and where is the least prime factor of ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.