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