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