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