Back to Problems

erdos_890.parts.a

Specification

If $\omega(n)$ counts the number of distinct prime factors of $n$, then is it true that, for every $k\geq 1$, $\liminf_{n\to \infty}\sum_{0\leq i < k}\omega(n+i)\leq k+\pi(k)?$

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement
theorem erdos_890.parts.a :
    answer(sorry) ↔ ∀ k ≥ 1, liminf (fun n ↦ (∑ i ∈ range k, (ω (n + i) : EReal))) atTop ≤ k + π k
ID: ErdosProblems__890__erdos_890.parts.a
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.