lean_workbook_plus_27817

⚠️ 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.

There are $m$ distinct positive even integer and $n$ distinct positive odd integer which sum up to $2005$ . For these values of $m,n$ , what is the maximum value of $3m+4n$ ?

Why this node was retired

The posted statement is

theorem lean_workbook_plus_27817 (m n : ℕ) (h₁ : Even m ∧ Odd n) (h₂ : m + n = 2005) : 3*m + 4*n <= 220   :=  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

Quantify finite sets E of distinct positive even integers and O of distinct positive odd integers with sum(E)+sum(O)=2005; put m=|E|,n=|O| and find the greatest attainable 3m+4n. Do not impose parity on the counts or replace the sum of elements by m+n.

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.