The GCD of given numbers is 10.
Step 1 :
Divide $ 15370 $ by $ 10370 $ and get the remainder
The remainder is positive ($ 5000 > 0 $), so we will continue with division.
Step 2 :
Divide $ 10370 $ by $ \color{blue}{ 5000 } $ and get the remainder
The remainder is still positive ($ 370 > 0 $), so we will continue with division.
Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 370 } $ and get the remainder
The remainder is still positive ($ 190 > 0 $), so we will continue with division.
Step 4 :
Divide $ 370 $ by $ \color{blue}{ 190 } $ and get the remainder
The remainder is still positive ($ 180 > 0 $), so we will continue with division.
Step 5 :
Divide $ 190 $ by $ \color{blue}{ 180 } $ and get the remainder
The remainder is still positive ($ 10 > 0 $), so we will continue with division.
Step 6 :
Divide $ 180 $ 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.
| 15370 | : | 10370 | = | 1 | remainder ( 5000 ) | ||||||||||
| 10370 | : | 5000 | = | 2 | remainder ( 370 ) | ||||||||||
| 5000 | : | 370 | = | 13 | remainder ( 190 ) | ||||||||||
| 370 | : | 190 | = | 1 | remainder ( 180 ) | ||||||||||
| 190 | : | 180 | = | 1 | remainder ( 10 ) | ||||||||||
| 180 | : | 10 | = | 18 | remainder ( 0 ) | ||||||||||
| GCD = 10 | |||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.