The GCD of given numbers is 10.
Step 1 :
Divide $ 17930 $ by $ 12930 $ and get the remainder
The remainder is positive ($ 5000 > 0 $), so we will continue with division.
Step 2 :
Divide $ 12930 $ by $ \color{blue}{ 5000 } $ and get the remainder
The remainder is still positive ($ 2930 > 0 $), so we will continue with division.
Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 2930 } $ and get the remainder
The remainder is still positive ($ 2070 > 0 $), so we will continue with division.
Step 4 :
Divide $ 2930 $ by $ \color{blue}{ 2070 } $ and get the remainder
The remainder is still positive ($ 860 > 0 $), so we will continue with division.
Step 5 :
Divide $ 2070 $ by $ \color{blue}{ 860 } $ and get the remainder
The remainder is still positive ($ 350 > 0 $), so we will continue with division.
Step 6 :
Divide $ 860 $ by $ \color{blue}{ 350 } $ and get the remainder
The remainder is still positive ($ 160 > 0 $), so we will continue with division.
Step 7 :
Divide $ 350 $ by $ \color{blue}{ 160 } $ and get the remainder
The remainder is still positive ($ 30 > 0 $), so we will continue with division.
Step 8 :
Divide $ 160 $ by $ \color{blue}{ 30 } $ and get the remainder
The remainder is still positive ($ 10 > 0 $), so we will continue with division.
Step 9 :
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.
| 17930 | : | 12930 | = | 1 | remainder ( 5000 ) | ||||||||||||||||
| 12930 | : | 5000 | = | 2 | remainder ( 2930 ) | ||||||||||||||||
| 5000 | : | 2930 | = | 1 | remainder ( 2070 ) | ||||||||||||||||
| 2930 | : | 2070 | = | 1 | remainder ( 860 ) | ||||||||||||||||
| 2070 | : | 860 | = | 2 | remainder ( 350 ) | ||||||||||||||||
| 860 | : | 350 | = | 2 | remainder ( 160 ) | ||||||||||||||||
| 350 | : | 160 | = | 2 | remainder ( 30 ) | ||||||||||||||||
| 160 | : | 30 | = | 5 | 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.