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