GCD & LCMeasy
0:00.0

Bezout's identity states that for integers aa and bb, there exist integers x,yx, y such that gcd(a,b)=ax+by\gcd(a, b) = ax + by. For a=12,b=8a = 12, b = 8, which pair (x,y)(x, y) satisfies this?