odd_prime_sierpinski
Disproved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Disprovedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Odd prime Sierpinski problem: A Sierpinski number is an odd k where k·2ⁿ+1 is composite for all n. The smallest such k is 78557 (Sierpinski 1960). Proving no smaller k works requires finding primes for each candidate k.
Why this node was retired
The posted statement is
import Mathlib
theorem odd_prime_sierpinski :
∀ k : ℕ, ∃ p : ℕ, Nat.Prime p ∧ Nat.Prime (k * 2 ^ p + 1) := by
sorry
The formula includes k=0 and universally promises a prime for every k, contradicting the Sierpiński-number exclusion described in the prose.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
Use positive odd k and formulate the actual Sierpiński problem: characterize k for which ∀n≥1,k*2^n+1 is composite, or seek the least such k. Simply requiring k>0 does not make the universal prime-existence claim true.
Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.
import Mathlib
import Mathlib
theorem odd_prime_sierpinski :
∀ k : ℕ, ∃ p : ℕ, Nat.Prime p ∧ Nat.Prime (k * 2 ^ p + 1) := by
sorry