GCD & LCMmedium
0:00.0

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