lean_workbook_plus_16562
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 .
Why this node was retired
The posted statement is
theorem lean_workbook_plus_16562 : ∀ k n : ℕ, k ≠ 0 ∧ n ≠ 0 → 1 / (k * (n - k + 1)) = (1 / k + 1 / (1 + n - k)) * (1 / (n + 1)) := by sorry
Natural divisions and truncated n−k replace an exact partial-fraction identity; bounds do not ensure k≤n.
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 rational/real division with 1≤k≤n and prove the displayed 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_16562 : ∀ k n : ℕ, k ≠ 0 ∧ n ≠ 0 → 1 / (k * (n - k + 1)) = (1 / k + 1 / (1 + n - k)) * (1 / (n + 1)) := by sorry