lean_workbook_plus_81010

Proved

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

Let $a,m$ be coprime integers. Show that $\forall a$ there exist $x$ with $ax \equiv 1 (\mod m)$ .

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_81010 {a m : ℤ} (h : a.gcd m = 1) : ∃ x, a * x ≡ 1 [ZMOD m]   :=  by sorry

Source