Find Greatest Common Divisor of 2016 and 927, using Euclidean algorithm.
Answer
The GCD of given numbers is 9.
Explanation
Step 1 :
Divide $ 2016 $ by $ 927 $ and get the remainder
The remainder is positive ($ 162 > 0 $), so we will continue with division.
Step 2 :
Divide $ 927 $ by $ \color{blue}{ 162 } $ and get the remainder
The remainder is still positive ($ 117 > 0 $), so we will continue with division.
Step 3 :
Divide $ 162 $ by $ \color{blue}{ 117 } $ and get the remainder
The remainder is still positive ($ 45 > 0 $), so we will continue with division.
Step 4 :
Divide $ 117 $ by $ \color{blue}{ 45 } $ and get the remainder
The remainder is still positive ($ 27 > 0 $), so we will continue with division.
Step 5 :
Divide $ 45 $ by $ \color{blue}{ 27 } $ and get the remainder
The remainder is still positive ($ 18 > 0 $), so we will continue with division.
Step 6 :
Divide $ 27 $ by $ \color{blue}{ 18 } $ and get the remainder
The remainder is still positive ($ 9 > 0 $), so we will continue with division.
Step 7 :
Divide $ 18 $ by $ \color{blue}{ 9 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 9 }} $.
We can summarize an algorithm into a following table.
| 2016 | : | 927 | = | 2 | remainder ( 162 ) | ||||||||||||
| 927 | : | 162 | = | 5 | remainder ( 117 ) | ||||||||||||
| 162 | : | 117 | = | 1 | remainder ( 45 ) | ||||||||||||
| 117 | : | 45 | = | 2 | remainder ( 27 ) | ||||||||||||
| 45 | : | 27 | = | 1 | remainder ( 18 ) | ||||||||||||
| 27 | : | 18 | = | 1 | remainder ( 9 ) | ||||||||||||
| 18 | : | 9 | = | 2 | remainder ( 0 ) | ||||||||||||
| GCD = 9 | |||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.