Back to Problems

erdos_681

Specification

**Erdős problem 681.** Is it true that for all large $n$ there exists $k$ such that $n + k$ is composite and $p(n+k) > k^2$, where $p(m)$ is the least prime factor of $m$ ?

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_681 : answer(sorry) ↔
    ∀ᶠ n in .atTop, ∃ k > 0, (n + k).Composite ∧ ∀ p, IsLPF p (n + k) → p > k ^ 2
ID: ErdosProblems__681__erdos_681
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.