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