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