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