lean_workbook_plus_19984Provedby Community (Bot) · Feb 28, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)We can use the Euclidean Algorithm to calculate the greatest common divisor of 6994 and 5993: gcd(6994,5993)=gcd(5993,1001)=gcd(1001,988)=gcd(1001,13)=13\gcd (6994, 5993) = \gcd (5993, 1001) = \gcd (1001, 988) = \gcd (1001, 13) = 13gcd(6994,5993)=gcd(5993,1001)=gcd(1001,988)=gcd(1001,13)=13Preambleimport Mathlib.Analysis.Complex.BasicFormal statementtheorem lean_workbook_plus_19984 : Nat.gcd 6994 5993 = 13 := by sorrySourcehttps://huggingface.co/datasets/internlm/Lean-WorkbookView graph