Ononot — Use the Extended Euclidean Algorithm to find integers x and

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

GCD & LCMmedium

0:00.0

Use the Extended Euclidean Algorithm to find integers $x$ and $y$ such that $21x + 14y = \gcd(21, 14)$ . Which pair $(x, y)$ is correct?