Use the Euclidean algorithm to find the greatest common divisor of the following pairs of integers and express it as a linear combination of the pair. You are expected to show all the steps in the algorithm (you may use a table format as shown in class )

(a) 4001, 2689 

(b) 2947, 3997

Answer rating: 100% (QA)

a 4001 2689 on m we have 4001 1X2689 13120 4001 divid... View the full answer