Erdős Problem #463 — Given c, is it true that for n > n_0(c) there is always a composite number m > n + c for which m - p(m) < n?
Statement
Given , is it true that for there is always a composite number for which ?
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.