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