lean_workbook_plus_10987

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

$\frac{2n + 1}{3}$ is an integer iff $3 \mid 2n +1$ or $2n+1 \equiv 0 \pmod{3}$ .

Why this node was retired

The posted statement is

theorem lean_workbook_plus_10987 : ∀ n : ℤ, (2 * n + 1) / 3 = ⌊(2 * n + 1) / 3⌋ ↔ 3 ∣ (2 * n + 1)   :=  by sorry

Cast n into ℚ or ℝ before division and express integrality of that rational value, rather than taking the floor after integer division.

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

Proposed corrected statement

Cast n into ℚ or ℝ before division and express integrality of that rational value, rather than taking the floor after integer division.

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.