2.1 GCDs

Run Euclid Run


Calculate \(GCD(874,1944)\) using Euclid's Algorithm.

Exercise 1

\(GCD(1944, 874)=GCD(874, rem(1944,874)) \\=GCD(874, 196)=GCD(196, rem(874,196)) \\=GCD(196, 90)=GCD(90, rem(196,90)) \\=GCD(90, 16)=GCD(16, rem(90,16)) \\=GCD(16, 10)=GCD(10, rem(16,10)) \\=GCD(10, 6)=GCD(6, rem(10,6)) \\=GCD(6, 4)=GCD(4, rem(6,4)) \\=GCD(4, 2)=GCD(2, rem(4,2)) \\=GCD(2, 0)=2\)