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