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