Ononot — Using the Euclidean algorithm, find the \text{GCD}(105, 42)

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

GCD & LCMhard

0:00.0

Using the Euclidean algorithm, find the $\text{GCD}(105, 42)$ and represent it in the form $105x + 42y$ . Which pair $(x, y)$ is valid?