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

When computing gcd⁡(167,62)\gcd(167, 62)gcd(167,62) using the Euclidean algorithm, the first step gives: 167=62⋅q+r167 = 62 \cdot q + r167=62⋅q+r where 0≤r<620 \leq r < 620≤r<62. What are qqq and rrr?