Erdős Problem #680 — Is it true that, for all sufficiently large n, there exists some k such that p(n+k)>k^2+1, where p(m) denotes the least prime factor of m?
Statement
Is it true that, for all sufficiently large , there exists some such that where denotes the least prime factor of ? Can one prove this is false if we replace by , for all , where is some constant?
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.