Back to Problems

erdos_891.variants.case_k_2

Specification

This is unknown even for $k=2$ - that is, is it true that in every interval of $6$ (sufficiently large) consecutive integers there must exist one with at least $3$ prime factors?

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_891.variants.case_k_2 :
    answer(sorry) ↔ ∀ᶠ n in atTop,
      ∃ m ∈ Ico n (n + 6), 3 ≤ ω m
ID: ErdosProblems__891__erdos_891.variants.case_k_2
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.