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