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