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