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