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