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