Back to Problems

erdos_385.parts.ii

Specification

Let $F(n) := \max\{m + p(m) \mid \textrm{$m < n$ composite}\}\}$ where $p(m)$ is the least prime divisor of $m$. Does $F(n) - n \to \infty$ as $n\to\infty$?

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
theorem erdos_385.parts.ii : answer(sorry) ↔ atTop.Tendsto (fun n ↦ F n - n) atTop
ID: ErdosProblems__385__erdos_385.parts.ii
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.