Problem
NT-B1-M02-P001 Euclid for Two Numbers
#1
★☆☆☆☆ Level 1 of 5
Find \(\gcd(252,198)\) using the Euclidean algorithm.
Repeatedly replace the larger number by the remainder.
\(\gcd(252,198)=\gcd(198,54)=\gcd(54,36)=\gcd(36,18)=18\). The answer is \(18\).
Basic computation, but with the right method.