lean_workbook_plus_22436

Proved

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

Prove that if $a$ and $b$ are integers with $\gcd(a,b)=d$ , then there exist integers $x$ and $y$ such that $ax+by=d$ .

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_22436 (a b d : ℤ) (hd : d = gcd a b) : ∃ x y : ℤ, a * x + b * y = d   :=  by sorry

Source