Grade 10 Mathematics 5. Theme · Question 11: What is the remainder found in the first step when calculating GCD(126, 54) using the Euclidean algorithm?
Source: Raista (original, based on textbook learning outcomes)
Question
What is the remainder found in the first step when calculating GCD(126, 54) using the Euclidean algorithm?
- 0
- 12
- 18
- 24
- 72
Solution
126 = 2·54 + 18; then 54 = 3·18 + 0 → GCD 18.