Let$$F(n)=\underset{\begin{array}{c}m<n\\ m\text{ composite}\end{array}}{\max }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$? Does $F(n)-n\to \infty$ as $n\to \infty$?

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

This is an old Erdős question (now “Erdős Problem #385”) and it is **still open** in general. ([Erdős Problems][1])

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.