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