lean_workbook_plus_51247
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.
Find all ordered pairs of positive integers satisfying the following equation: .
Why this node was retired
The posted statement is
theorem lean_workbook_plus_51247 (m n : ℕ) (hmn: m ≠ 0 ∧ n ≠ 0) (h : (m^3 + n^3) / (m^2 + n^2 + m + n) = 800) : (m = 1 ∧ n = 7) ∨ (m = 7 ∧ n = 1) ∨ (m = 1999 ∧ n = 2000) ∨ (m = 2000 ∧ n = 1999) := by sorry
The formal statement changes or incorrectly supplies part of the source problem; the accepted note identifies a concrete witness or definitional mechanism.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
Find all positive integer pairs with m³+n³=800(m²+n²+m+n), equivalently exact rational division. Prove a complete classification instead of retaining the unsupported four-pair list.
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_51247 (m n : ℕ) (hmn: m ≠ 0 ∧ n ≠ 0) (h : (m^3 + n^3) / (m^2 + n^2 + m + n) = 800) : (m = 1 ∧ n = 7) ∨ (m = 7 ∧ n = 1) ∨ (m = 1999 ∧ n = 2000) ∨ (m = 2000 ∧ n = 1999) := by sorry