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