Erdős Problem 891: Weisenberg
Weisenberg has observed that Dickson's conjecture implies the answer is no if we replace with . Indeed, let be the lowest common multiple of all integers at most . By Dickson's conjecture [Wikipedia], th...
Mathematical statement
Weisenberg has observed that Dickson's conjecture implies the answer is no if we replace with . Indeed, let be the lowest common multiple of all integers at most . By Dickson's conjecture [Wikipedia], there are infinitely many such that is prime for all . It follows that, if , then all integers in have at most 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.weisenberg
theorem erdos_891.variants.weisenberg (k : ℕ) (hk : k ≥ 2) : ∃ᶠ n in atTop, ∀ m ∈ Ico n (n + (∏ i ∈ range k, i.nth Nat.Prime) - 1), ω m ≤ k := 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