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