Euclidean algorithm?

Question

Use the Euclidean algroithm ot compute the greatest common divisor of 10032 and 6800.

Answer 1

10032 mod 6800 = 3232
6800 mod 3232 = 336
3232 mod 336 = 208
336 mod 208 = 128
208 mod 128 = 80
128 mod 80 = 48
80 mod 48 = 32
48 mod 32 = 16
32 mod 16 = 0
So 16 = GCF
10032/16= 627
6800/16 =425

Answer 2

Hello

Let A = 10032 and B= 6800

10,032 = 6800*1 +3232 thus gcd(10032, 6800) = gcd(6800, 3232)

6800 = 3232(2) + 336 thus gcd(6800, 3232) = gcd(3232, 336 )

3232 = 336(9) +208 thus gcd(3232,336) = gcd(336,208)

336 = 208(1) + 128 thus gcd(336,208) = gcd(208, 128)

208 = 128(1) + 80..................

128 = 80(1) + 48..................

80 = 48(1) + 32 ..................

48 = 32(1) + 16 ..................

32 = 16(2) ..................

Thus 2 is the GCD for 10032 and 6800

Hope this helps