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