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

Using Bezout's identity with the extended Euclidean algorithm, find an integer value of xxx such that 13x+8y=gcd⁡(13,8)=113x + 8y = \gcd(13, 8) = 113x+8y=gcd(13,8)=1 for some integer yyy.​