Question

For a given integer a,b use the euclidean algorithm to obtain integers x,y such that (a,b)=ax+by....56,72

Answer 1

Step-by-step explanation:

Euclidean Algorithm for finding GCD(A,B) is as follows: If A = 0 then ... Suppose we have three integers A,B and C such that A-B=C. ... i.e. Y⋅GCD(A,B)=B where Y is some ...