The GCD of given numbers is 21.
Step 1 :
Divide $ 588 $ by $ 231 $ and get the remainder
The remainder is positive ($ 126 > 0 $), so we will continue with division.
Step 2 :
Divide $ 231 $ by $ \color{blue}{ 126 } $ and get the remainder
The remainder is still positive ($ 105 > 0 $), so we will continue with division.
Step 3 :
Divide $ 126 $ by $ \color{blue}{ 105 } $ and get the remainder
The remainder is still positive ($ 21 > 0 $), so we will continue with division.
Step 4 :
Divide $ 105 $ 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.
| 588 | : | 231 | = | 2 | remainder ( 126 ) | ||||||
| 231 | : | 126 | = | 1 | remainder ( 105 ) | ||||||
| 126 | : | 105 | = | 1 | remainder ( 21 ) | ||||||
| 105 | : | 21 | = | 5 | remainder ( 0 ) | ||||||
| GCD = 21 | |||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.