lean_workbook_plus_36270

Proved

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

Prove that if $a,n \in \mathbb N \wedge \gcd(a,n) = 1$ you can find $x, y \in \mathbb Z$ such that $ax + ny = 1$ .

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_36270 {a n : ℕ} (h : Nat.gcd a n = 1) : ∃ x y : ℤ, a * x + n * y = 1   :=  by sorry

Source