Intermediate
Discrete Mathematics & Math
Q70 / 100
Using the Euclidean algorithm, what is gcd(252, 105)?
Correct! Well done.
Incorrect.
The correct answer is B) 21
B
Correct Answer
21
Explanation
252 = 2(105) + 42; 105 = 2(42) + 21; 42 = 2(21) + 0. The last nonzero remainder is 21, so gcd(252,105) = 21. Each step replaces (a,b) with (b, a mod b) until the remainder is zero.
Progress
70/100