lean_workbook_plus_22045

⚠️ Retired — specification defect

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

Given are positive integers $n>20$ and $k>1$ , such that $k^2$ divides $n$ . Prove that there exist positive integers $a, b, c$ , such that $n=ab+bc+ca$ .

Why this node was retired

The posted statement is

theorem lean_workbook_plus_22045 (n : ℕ) (k : ℕ) (h₁ : 0 < n ∧ 0 < k) (h₂ : k^2 ∣ n) : ∃ a b c : ℕ, n = a * b + b * c + c * a   :=  by sorry

The three requested positive integers become unrestricted naturals.

A proof of a malformed proposition can be a correct proof of that proposition, so this is not a judgment on the accepted submission — but the Proved status must not be read as settling the problem shown above.

Proposed corrected statement

Restore n>20, k>1, k²∣n and require 0<a, 0<b, 0<c for the witnesses.

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.