The GCD of given numbers is 1.
Step 1 :
Divide $ 1000 $ by $ 1 $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 1 }} $.
We can summarize an algorithm into a following table.
1000 | : | 1 | = | 1000 | remainder ( 0 ) |
GCD = 1 |
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.