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