The GCD of given numbers is 15.
Step 1 :
Divide $ 5445 $ by $ 2550 $ and get the remainder
The remainder is positive ($ 345 > 0 $), so we will continue with division.
Step 2 :
Divide $ 2550 $ by $ \color{blue}{ 345 } $ and get the remainder
The remainder is still positive ($ 135 > 0 $), so we will continue with division.
Step 3 :
Divide $ 345 $ by $ \color{blue}{ 135 } $ and get the remainder
The remainder is still positive ($ 75 > 0 $), so we will continue with division.
Step 4 :
Divide $ 135 $ by $ \color{blue}{ 75 } $ and get the remainder
The remainder is still positive ($ 60 > 0 $), so we will continue with division.
Step 5 :
Divide $ 75 $ by $ \color{blue}{ 60 } $ and get the remainder
The remainder is still positive ($ 15 > 0 $), so we will continue with division.
Step 6 :
Divide $ 60 $ 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.
| 5445 | : | 2550 | = | 2 | remainder ( 345 ) | ||||||||||
| 2550 | : | 345 | = | 7 | remainder ( 135 ) | ||||||||||
| 345 | : | 135 | = | 2 | remainder ( 75 ) | ||||||||||
| 135 | : | 75 | = | 1 | remainder ( 60 ) | ||||||||||
| 75 | : | 60 | = | 1 | remainder ( 15 ) | ||||||||||
| 60 | : | 15 | = | 4 | remainder ( 0 ) | ||||||||||
| GCD = 15 | |||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.