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