lean_workbook_plus_49745
ProvedProve the linear representation of the greatest common divisor (gcd) of two integers and , i.e., that there exist integers and such that .
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_49745 (a b : ℤ) : ∃ x y : ℤ, gcd a b = x * a + y * b := by sorry
Source