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