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