The GCD of given numbers is 250.
Step 1 :
Divide $ 17250 $ by $ 12250 $ and get the remainder
The remainder is positive ($ 5000 > 0 $), so we will continue with division.
Step 2 :
Divide $ 12250 $ by $ \color{blue}{ 5000 } $ and get the remainder
The remainder is still positive ($ 2250 > 0 $), so we will continue with division.
Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 2250 } $ and get the remainder
The remainder is still positive ($ 500 > 0 $), so we will continue with division.
Step 4 :
Divide $ 2250 $ by $ \color{blue}{ 500 } $ and get the remainder
The remainder is still positive ($ 250 > 0 $), so we will continue with division.
Step 5 :
Divide $ 500 $ by $ \color{blue}{ 250 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 250 }} $.
We can summarize an algorithm into a following table.
| 17250 | : | 12250 | = | 1 | remainder ( 5000 ) | ||||||||
| 12250 | : | 5000 | = | 2 | remainder ( 2250 ) | ||||||||
| 5000 | : | 2250 | = | 2 | remainder ( 500 ) | ||||||||
| 2250 | : | 500 | = | 4 | remainder ( 250 ) | ||||||||
| 500 | : | 250 | = | 2 | remainder ( 0 ) | ||||||||
| GCD = 250 | |||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.