perfect_number_even_form
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.
Euler's theorem on even perfect numbers: Every even perfect number has the form 2^{p-1}(2^p-1) where 2^p-1 is a Mersenne prime. Proved by Euler (unpublished, published posthumously). The converse is Euclid's theorem.
Why this node was retired
The posted statement is
import Mathlib
theorem perfect_number_even_form (n : ℕ) (hn : 2 ∣ n) (hperf : n.divisors.sum id = 2 * n) :
∃ p : ℕ, Nat.Prime p ∧ Nat.Prime (2 ^ p - 1) ∧ n = 2 ^ (p - 1) * (2 ^ p - 1) := by
sorry
The divisor-sum predicate accepts n=0 because Lean defines zero.divisors as empty.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
Require 0<n in addition to evenness and the divisor-sum equality.
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 perfect_number_even_form (n : ℕ) (hn : 2 ∣ n) (hperf : n.divisors.sum id = 2 * n) :
∃ p : ℕ, Nat.Prime p ∧ Nat.Prime (2 ^ p - 1) ∧ n = 2 ^ (p - 1) * (2 ^ p - 1) := by
sorry