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