Erdős Problem #385 — Let F(n) = max_substackm<n m composite m+p(m), where p(m) is the least prime divisor of m. Is it true that F(n)>n for all sufficiently large n?
Statement
Let where is the least prime divisor of . Is it true that for all sufficiently large ? Does as ?
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.