Question 1 of 150
In the Euclidean algorithm for gcd(180, 84), what is the first remainder when 180 is divided by 84?
○ 13
○ 72
12
○ 264
Show explanation
The first Euclidean step replaces the larger number by the remainder after division. — Examisthan.com
You've explored today's free questions 🎓
Want to keep going? Unlock more by watching an ad, or subscribe for unlimited access to every question.
Going a bit fast!
You're clicking through quickly — give it a short moment and the next question will load on its own.
Resuming in 15s...
You've completed all 150 questions! 🎉
Nice work — you've gone through every practice question in this set. Use Previous to review any of them again.