The GCD of given numbers is 1.
Step 1 :
Divide $ 3991 $ by $ 328 $ and get the remainder
The remainder is positive ($ 55 > 0 $), so we will continue with division.
Step 2 :
Divide $ 328 $ by $ \color{blue}{ 55 } $ and get the remainder
The remainder is still positive ($ 53 > 0 $), so we will continue with division.
Step 3 :
Divide $ 55 $ by $ \color{blue}{ 53 } $ and get the remainder
The remainder is still positive ($ 2 > 0 $), so we will continue with division.
Step 4 :
Divide $ 53 $ by $ \color{blue}{ 2 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 5 :
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.
| 3991 | : | 328 | = | 12 | remainder ( 55 ) | ||||||||
| 328 | : | 55 | = | 5 | remainder ( 53 ) | ||||||||
| 55 | : | 53 | = | 1 | remainder ( 2 ) | ||||||||
| 53 | : | 2 | = | 26 | 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.