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