lean_workbook_plus_34482

Proved

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

Find all positive integers $n$ such that $n$ is congruent to $2$ or $3$ modulo $4$ .

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_34482 (n : ℕ) (hn: n > 0) : (n ≡ 2 [ZMOD 4]) ∨ (n ≡ 3 [ZMOD 4]) ↔ (n % 4 = 2 ∨ n % 4 = 3)   :=  by sorry

Source