Chapter 4 - Elementary Number Theory and Methods of Proof - Exercise Set 4.8 - Page 225: 15

13

gcd(10933, 832) Set up a division problem where a is larger than b. a ÷ b = c with the remainder. When remainder = 0, the GCD is the divisor, b, in the last equation 10933 = 832 * 13 +117 gcd(10933, 832) = gcd(832, 117) 832 = 117 * 7 +13 gcd(832, 117) = gcd(117, 13) 117 = 13 * 9 + 0 gcd(117, 13) = 13 Therefore the greatest common divisor of 832 and 10933 is 13