Computer Science, asked by mohanamoni2727, 7 months ago

Formulate gcd(98,56) using extended Euclidean algorithm. Write the algorithm also​

Answers

Answered by harnathyadav2907
7

Explanation:

This is a certifying algorithm, because the gcd is the only number that can simultaneously satisfy this equation and divide the inputs. It allows one to compute also, with almost no extra cost, the quotients of a and b by their greatest common divisor.

Similar questions