The GCD of given numbers is 10.
Step 1 :
Divide $ 18430 $ by $ 13430 $ and get the remainder
The remainder is positive ($ 5000 > 0 $), so we will continue with division.
Step 2 :
Divide $ 13430 $ by $ \color{blue}{ 5000 } $ and get the remainder
The remainder is still positive ($ 3430 > 0 $), so we will continue with division.
Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 3430 } $ and get the remainder
The remainder is still positive ($ 1570 > 0 $), so we will continue with division.
Step 4 :
Divide $ 3430 $ by $ \color{blue}{ 1570 } $ and get the remainder
The remainder is still positive ($ 290 > 0 $), so we will continue with division.
Step 5 :
Divide $ 1570 $ by $ \color{blue}{ 290 } $ and get the remainder
The remainder is still positive ($ 120 > 0 $), so we will continue with division.
Step 6 :
Divide $ 290 $ by $ \color{blue}{ 120 } $ and get the remainder
The remainder is still positive ($ 50 > 0 $), so we will continue with division.
Step 7 :
Divide $ 120 $ by $ \color{blue}{ 50 } $ and get the remainder
The remainder is still positive ($ 20 > 0 $), so we will continue with division.
Step 8 :
Divide $ 50 $ 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.
| 18430 | : | 13430 | = | 1 | remainder ( 5000 ) | ||||||||||||||||
| 13430 | : | 5000 | = | 2 | remainder ( 3430 ) | ||||||||||||||||
| 5000 | : | 3430 | = | 1 | remainder ( 1570 ) | ||||||||||||||||
| 3430 | : | 1570 | = | 2 | remainder ( 290 ) | ||||||||||||||||
| 1570 | : | 290 | = | 5 | remainder ( 120 ) | ||||||||||||||||
| 290 | : | 120 | = | 2 | remainder ( 50 ) | ||||||||||||||||
| 120 | : | 50 | = | 2 | remainder ( 20 ) | ||||||||||||||||
| 50 | : | 20 | = | 2 | 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.