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