The GCD of given numbers is 50.
Step 1 :
Divide $ 16650 $ by $ 11650 $ and get the remainder
The remainder is positive ($ 5000 > 0 $), so we will continue with division.
Step 2 :
Divide $ 11650 $ by $ \color{blue}{ 5000 } $ and get the remainder
The remainder is still positive ($ 1650 > 0 $), so we will continue with division.
Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 1650 } $ and get the remainder
The remainder is still positive ($ 50 > 0 $), so we will continue with division.
Step 4 :
Divide $ 1650 $ by $ \color{blue}{ 50 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 50 }} $.
We can summarize an algorithm into a following table.
| 16650 | : | 11650 | = | 1 | remainder ( 5000 ) | ||||||
| 11650 | : | 5000 | = | 2 | remainder ( 1650 ) | ||||||
| 5000 | : | 1650 | = | 3 | remainder ( 50 ) | ||||||
| 1650 | : | 50 | = | 33 | remainder ( 0 ) | ||||||
| GCD = 50 | |||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.