Using the Extended Euclidean Algorithm the greatest common divisor of 55 and 84 can be written...

Transcribed Image Text:

Using the Extended Euclidean Algorithm the greatest common divisor of 55 and 84 can be written as a linear combination of these integers. Find the smallest positive integer u greater than 100 satisfying 55u+84v = gcd (55,84). Using the Extended Euclidean Algorithm the greatest common divisor of 55 and 84 can be written as a linear combination of these integers. Find the smallest positive integer u greater than 100 satisfying 55u+84v = gcd (55,84).