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