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