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