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