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