The GCD of given numbers is 50.
Step 1 :
Divide $ 16550 $ by $ 11550 $ and get the remainder
The remainder is positive ($ 5000 > 0 $), so we will continue with division.
Step 2 :
Divide $ 11550 $ by $ \color{blue}{ 5000 } $ and get the remainder
The remainder is still positive ($ 1550 > 0 $), so we will continue with division.
Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 1550 } $ and get the remainder
The remainder is still positive ($ 350 > 0 $), so we will continue with division.
Step 4 :
Divide $ 1550 $ by $ \color{blue}{ 350 } $ and get the remainder
The remainder is still positive ($ 150 > 0 $), so we will continue with division.
Step 5 :
Divide $ 350 $ by $ \color{blue}{ 150 } $ and get the remainder
The remainder is still positive ($ 50 > 0 $), so we will continue with division.
Step 6 :
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.
| 16550 | : | 11550 | = | 1 | remainder ( 5000 ) | ||||||||||
| 11550 | : | 5000 | = | 2 | remainder ( 1550 ) | ||||||||||
| 5000 | : | 1550 | = | 3 | remainder ( 350 ) | ||||||||||
| 1550 | : | 350 | = | 4 | remainder ( 150 ) | ||||||||||
| 350 | : | 150 | = | 2 | 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.