GCD & LCMeasy
0:00.0

Using the extended Euclidean algorithm, which pair (x,y)(x, y) satisfies 15x+10y=gcd(15,10)15x + 10y = \gcd(15, 10)?