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