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