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