lean_workbook_plus_2368
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, for any positive integers and , .
Why this node was retired
The posted statement is
theorem lean_workbook_plus_2368 : ∀ n r : ℕ, (1 : ℚ) / (n + r).choose (r + 1) = (r + 1) / r * (1 / (n + r - 1).choose r - 1 / (n + r).choose r) := by sorry
The target drops both explicitly stated positivity assumptions on n and r.
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≥1 and r≥1 and retain the rational binomial-reciprocal identity.
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.Analysis.Complex.Basic
theorem lean_workbook_plus_2368 : ∀ n r : ℕ, (1 : ℚ) / (n + r).choose (r + 1) = (r + 1) / r * (1 / (n + r - 1).choose r - 1 / (n + r).choose r) := by sorry