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