Prove2Me

lean_workbook_plus_46940

Proved

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

To find gcd⁡(180,594)\gcd(180,594), we use the euclidean algorithm. We have \n594−3⋅180=54\n180−3⋅54=18\n54−3⋅18=0594-3\cdot 180=54 \n180-3\cdot 54=18 \n54-3\cdot 18=0 \nSo gcd⁡(180,594)=18\gcd(180,594)=18 .

Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_46940 :
  Nat.gcd 180 594 = 18   :=  by sorry
Source
https://huggingface.co/datasets/internlm/Lean-Workbook

View graph