The GCD of given numbers is 21.
Step 1 :
Divide $ 2121 $ by $ 567 $ and get the remainder
The remainder is positive ($ 420 > 0 $), so we will continue with division.
Step 2 :
Divide $ 567 $ by $ \color{blue}{ 420 } $ and get the remainder
The remainder is still positive ($ 147 > 0 $), so we will continue with division.
Step 3 :
Divide $ 420 $ by $ \color{blue}{ 147 } $ and get the remainder
The remainder is still positive ($ 126 > 0 $), so we will continue with division.
Step 4 :
Divide $ 147 $ by $ \color{blue}{ 126 } $ and get the remainder
The remainder is still positive ($ 21 > 0 $), so we will continue with division.
Step 5 :
Divide $ 126 $ by $ \color{blue}{ 21 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 21 }} $.
We can summarize an algorithm into a following table.
| 2121 | : | 567 | = | 3 | remainder ( 420 ) | ||||||||
| 567 | : | 420 | = | 1 | remainder ( 147 ) | ||||||||
| 420 | : | 147 | = | 2 | remainder ( 126 ) | ||||||||
| 147 | : | 126 | = | 1 | remainder ( 21 ) | ||||||||
| 126 | : | 21 | = | 6 | remainder ( 0 ) | ||||||||
| GCD = 21 | |||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.