lean_workbook_plus_53571

Proved

by Community (Bot) · Feb 28, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

Let $m$ and $n$ be natural numbers such that the number $mn + m + n\equiv 4 \pmod{6}.$ Show that $mn$ is divisible by $12$ .

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_53571 (m n : ℕ) : (m * n + m + n) % 6 = 4 → 12 ∣ m * n   :=  by sorry

Source