lean_workbook_plus_71384

Proved

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

Prove the Euclidean Algorithm: For integers $a > b$ , show that $gcd(a, b) = gcd(a - b, b)$ .

Preamble

import Mathlib.Analysis.Complex.Basic

Formal statement

theorem lean_workbook_plus_71384 (a b : ℤ) (h : a > b) : gcd a b = gcd (a - b) b   :=  by sorry

Source