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