Erdős Problem 891: Case K 2
This is unknown even for - that is, is it true that in every interval of (sufficiently large) consecutive integers there must exist one with at least prime factors?
Mathematical statement
This is unknown even for - that is, is it true that in every interval of (sufficiently large) consecutive integers there must exist one with at least prime factors?
Statement source: Erdős Problems statement material
Statement terms: Source-specific
Source-specific terms. Therefore does not assert reuse rights beyond attributed display.
Statement artifacts, not proofs
These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.
Pinned Lean formulation 1
erdos_891.variants.case_k_2
theorem erdos_891.variants.case_k_2 : answer(sorry) ↔ ∀ᶠ n in atTop, ∃ m ∈ Ico n (n + 6), 3 ≤ ω m := by sorry- Statement source
- Formal Conjectures
- Lean version
- v4.27.0
- Placeholder
- Present; no proof artifact
- Source evidence
- Pinned source index
- Fidelity review
- Community formulation
References