Use the extended Euclidean algorithm to find the greatest common divisor of the given numbers and express it as a linear combination of the two numbers. |(a) 1001 and 1331 (b) 9888 and 6060 (c) 12345...

Use the extended Euclidean algorithm to find the greatest common divisor of the
given numbers and express it as a linear combination of the two numbers.
(a) 1001 and 1331
(b) 9888 and 6060
(c) 12345 and 54321

Extracted text: Use the extended Euclidean algorithm to find the greatest common divisor of the given numbers and express it as a linear combination of the two numbers. |(a) 1001 and 1331 (b) 9888 and 6060 (c) 12345 and 54321