use the extended euclidean algorithm to find the greatest common divisor of 8,406 and 1,242 and express it as a linear combination of 8,406 and 1,242. step 1: find q1 and r1 so that 8,406