The GCD of given numbers is 10.
Step 1 :
Divide $ 15390 $ by $ 10390 $ and get the remainder
The remainder is positive ($ 5000 > 0 $), so we will continue with division.
Step 2 :
Divide $ 10390 $ by $ \color{blue}{ 5000 } $ and get the remainder
The remainder is still positive ($ 390 > 0 $), so we will continue with division.
Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 390 } $ and get the remainder
The remainder is still positive ($ 320 > 0 $), so we will continue with division.
Step 4 :
Divide $ 390 $ by $ \color{blue}{ 320 } $ and get the remainder
The remainder is still positive ($ 70 > 0 $), so we will continue with division.
Step 5 :
Divide $ 320 $ by $ \color{blue}{ 70 } $ and get the remainder
The remainder is still positive ($ 40 > 0 $), so we will continue with division.
Step 6 :
Divide $ 70 $ by $ \color{blue}{ 40 } $ and get the remainder
The remainder is still positive ($ 30 > 0 $), so we will continue with division.
Step 7 :
Divide $ 40 $ by $ \color{blue}{ 30 } $ and get the remainder
The remainder is still positive ($ 10 > 0 $), so we will continue with division.
Step 8 :
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.
| 15390 | : | 10390 | = | 1 | remainder ( 5000 ) | ||||||||||||||
| 10390 | : | 5000 | = | 2 | remainder ( 390 ) | ||||||||||||||
| 5000 | : | 390 | = | 12 | remainder ( 320 ) | ||||||||||||||
| 390 | : | 320 | = | 1 | remainder ( 70 ) | ||||||||||||||
| 320 | : | 70 | = | 4 | remainder ( 40 ) | ||||||||||||||
| 70 | : | 40 | = | 1 | 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.