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