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