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