The GCD of given numbers is 30.
Step 1 :
Divide $ 90 $ by $ 60 $ and get the remainder
The remainder is positive ($ 30 > 0 $), so we will continue with division.
Step 2 :
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.
| 90 | : | 60 | = | 1 | 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.