Ononot — Using the extended Euclidean algorithm, find integers x and

Guest Session: 1 Question Remaining. Create Account to save progress.

GCD & LCMmedium

0:00.0

Using the extended Euclidean algorithm, find integers $x$ and $y$ satisfying $56x + 35y = \gcd(56, 35)$ . What is $x - y$ ?