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