Exercise · ZW-EUCLIDEAN-DOMAIN-004 · ★☆☆ Basic
In \(\mathbb{Z}\), use the Euclidean algorithm to compute \(\gcd(252,198)\).
Choose one option.
Show answer
- D. \(18\)
Exercise · ZW-EUCLIDEAN-DOMAIN-004 · ★☆☆ Basic
Choose one option.
\(252=198+54\), \(198=3\cdot54+36\), \(54=36+18\), \(36=2\cdot18+0\). The last nonzero remainder is 18. The other values are common divisors, but not the greatest.
An integral domain \(D\) with a norm \(N\) (a function from \(D\setminus\{0\}\) to the nonnegative integers) allowing division of \(a\) by \(b\neq0\) with quotient \(q\) and remainder \(r\) zero or of smaller norm than \(b\).