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