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