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