The GCD of given numbers is 10.
Step 1 :
Divide $ 15110 $ by $ 10110 $ and get the remainder
The remainder is positive ($ 5000 > 0 $), so we will continue with division.
Step 2 :
Divide $ 10110 $ by $ \color{blue}{ 5000 } $ and get the remainder
The remainder is still positive ($ 110 > 0 $), so we will continue with division.
Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 110 } $ and get the remainder
The remainder is still positive ($ 50 > 0 $), so we will continue with division.
Step 4 :
Divide $ 110 $ by $ \color{blue}{ 50 } $ and get the remainder
The remainder is still positive ($ 10 > 0 $), so we will continue with division.
Step 5 :
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.
| 15110 | : | 10110 | = | 1 | remainder ( 5000 ) | ||||||||
| 10110 | : | 5000 | = | 2 | remainder ( 110 ) | ||||||||
| 5000 | : | 110 | = | 45 | remainder ( 50 ) | ||||||||
| 110 | : | 50 | = | 2 | 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.