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