The GCD of given numbers is 2.
Step 1 :
Divide $ 32842 $ by $ 5928 $ and get the remainder
The remainder is positive ($ 3202 > 0 $), so we will continue with division.
Step 2 :
Divide $ 5928 $ by $ \color{blue}{ 3202 } $ and get the remainder
The remainder is still positive ($ 2726 > 0 $), so we will continue with division.
Step 3 :
Divide $ 3202 $ by $ \color{blue}{ 2726 } $ and get the remainder
The remainder is still positive ($ 476 > 0 $), so we will continue with division.
Step 4 :
Divide $ 2726 $ by $ \color{blue}{ 476 } $ and get the remainder
The remainder is still positive ($ 346 > 0 $), so we will continue with division.
Step 5 :
Divide $ 476 $ by $ \color{blue}{ 346 } $ and get the remainder
The remainder is still positive ($ 130 > 0 $), so we will continue with division.
Step 6 :
Divide $ 346 $ by $ \color{blue}{ 130 } $ and get the remainder
The remainder is still positive ($ 86 > 0 $), so we will continue with division.
Step 7 :
Divide $ 130 $ by $ \color{blue}{ 86 } $ and get the remainder
The remainder is still positive ($ 44 > 0 $), so we will continue with division.
Step 8 :
Divide $ 86 $ by $ \color{blue}{ 44 } $ and get the remainder
The remainder is still positive ($ 42 > 0 $), so we will continue with division.
Step 9 :
Divide $ 44 $ by $ \color{blue}{ 42 } $ and get the remainder
The remainder is still positive ($ 2 > 0 $), so we will continue with division.
Step 10 :
Divide $ 42 $ 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.
| 32842 | : | 5928 | = | 5 | remainder ( 3202 ) | ||||||||||||||||||
| 5928 | : | 3202 | = | 1 | remainder ( 2726 ) | ||||||||||||||||||
| 3202 | : | 2726 | = | 1 | remainder ( 476 ) | ||||||||||||||||||
| 2726 | : | 476 | = | 5 | remainder ( 346 ) | ||||||||||||||||||
| 476 | : | 346 | = | 1 | remainder ( 130 ) | ||||||||||||||||||
| 346 | : | 130 | = | 2 | remainder ( 86 ) | ||||||||||||||||||
| 130 | : | 86 | = | 1 | remainder ( 44 ) | ||||||||||||||||||
| 86 | : | 44 | = | 1 | remainder ( 42 ) | ||||||||||||||||||
| 44 | : | 42 | = | 1 | remainder ( 2 ) | ||||||||||||||||||
| 42 | : | 2 | = | 21 | remainder ( 0 ) | ||||||||||||||||||
| GCD = 2 | |||||||||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.