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