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