Guest Session: 1 Question Remaining. Create Account to save progress.
Login
GCD & LCMmedium
0:00.0

Using the Extended Euclidean Algorithm, find integers xxx and yyy such that 120x+45y=GCD(120,45)120x + 45y = \text{GCD}(120, 45)120x+45y=GCD(120,45). Which of the following pairs (x,y)(x, y)(x,y) is a valid solution?