lean_workbook_plus_35383

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Disproved status carries no information about that problem. Do not import this node or use it as a dependency.

Prove that there are no non-trivial integer solutions to the equation $X^{n}+Y^{n}=Z^{n}$ for any odd prime $n$.

Why this node was retired

The posted statement is

theorem lean_workbook_plus_35383 (n : ℕ) (hn : n.Prime) (hodd : Odd n) : ¬ (∃ x y z : ℤ, x^n + y^n = z^n)   :=  by sorry

Define nontrivial integer solutions by xyz≠0, and require that condition in the existential quantifier.

The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.

Proposed corrected statement

Define nontrivial integer solutions by xyz≠0, and require that condition in the existential quantifier.

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.