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