Erdős Problem 1113: Filaseta Finch Kozek
Filaseta–Finch–Kozek conjecture (2008).* Every Sierpiński number is either a perfect power or possesses a finite covering set of primes.
Mathematical statement
Filaseta–Finch–Kozek conjecture (2008).* Every Sierpiński number is either a perfect power or possesses a finite covering set of primes.
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_1113.variants.filaseta_finch_kozek
theorem erdos_1113.variants.filaseta_finch_kozek : ∀ k, k.IsSierpinskiNumber → k.IsPerfectPower ∨ HasFinitePrimeCoveringSet 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