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