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