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