lean_workbook_plus_61578
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.
prove that \n
Why this node was retired
The posted statement is
theorem lean_workbook_plus_61578 : ∀ n : ℕ, (2 * n + 1)^n > (2 * n)^n + (2 * n - 1)^n := by sorry
The source does not specify its initial index.
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 n≥3; the strict inequality fails at n=0,1,2.
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.
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_61578 : ∀ n : ℕ, (2 * n + 1)^n > (2 * n)^n + (2 * n - 1)^n := by sorry
Source