no_wieferich_prime_odd_conjecture
Proved⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Provedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Non-Wieferich primes: Are there infinitely many non-Wieferich primes (primes p where p² ∤ 2^{p-1}-1)? Only two Wieferich primes known: 1093 and 3511. Infinitely many non-Wieferich primes follows from ABC conjecture.
Why this node was retired
The posted statement is
import Mathlib
theorem no_wieferich_prime_odd_conjecture :
∀ p : ℕ, Nat.Prime p → ¬ 2 ∣ p →
¬ ((p ^ 2 : ℤ) ∣ (p - 1 : ℤ).toNat.factorial) := by
sorry
The factorial (p−1)! replaces 2^(p−1)−1, and an infinitude question becomes a universal nondivisibility assertion.
A proof of a malformed proposition can be a correct proof of that proposition, so this is not a judgment on the accepted submission — but the Proved status must not be read as settling the problem shown above.
Proposed corrected statement
State that {p:ℕ | p.Prime ∧ ¬p²∣2^(p−1)−1} is infinite; this restores the intended infinitude question.
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 no_wieferich_prime_odd_conjecture :
∀ p : ℕ, Nat.Prime p → ¬ 2 ∣ p →
¬ ((p ^ 2 : ℤ) ∣ (p - 1 : ℤ).toNat.factorial) := by
sorry