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