lean_workbook_plus_65008

Proved

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

If $p$ is some prime dividing $m+n$ , then $m \equiv -n \pmod{p} \implies m^2 \equiv n^2 \pmod{p}$ .

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_65008 (p m n : ℕ) (hp : p.Prime) (hp1 : p ∣ m + n) (h : m ≡ -n [ZMOD p]) : m^2 ≡ n^2 [ZMOD p]   :=  by sorry

Source