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