The GCD of given numbers is 1.
Step 1 :
Divide $ 3551 $ by $ 741 $ and get the remainder
The remainder is positive ($ 587 > 0 $), so we will continue with division.
Step 2 :
Divide $ 741 $ by $ \color{blue}{ 587 } $ and get the remainder
The remainder is still positive ($ 154 > 0 $), so we will continue with division.
Step 3 :
Divide $ 587 $ by $ \color{blue}{ 154 } $ and get the remainder
The remainder is still positive ($ 125 > 0 $), so we will continue with division.
Step 4 :
Divide $ 154 $ by $ \color{blue}{ 125 } $ and get the remainder
The remainder is still positive ($ 29 > 0 $), so we will continue with division.
Step 5 :
Divide $ 125 $ by $ \color{blue}{ 29 } $ and get the remainder
The remainder is still positive ($ 9 > 0 $), so we will continue with division.
Step 6 :
Divide $ 29 $ by $ \color{blue}{ 9 } $ and get the remainder
The remainder is still positive ($ 2 > 0 $), so we will continue with division.
Step 7 :
Divide $ 9 $ by $ \color{blue}{ 2 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 8 :
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.
| 3551 | : | 741 | = | 4 | remainder ( 587 ) | ||||||||||||||
| 741 | : | 587 | = | 1 | remainder ( 154 ) | ||||||||||||||
| 587 | : | 154 | = | 3 | remainder ( 125 ) | ||||||||||||||
| 154 | : | 125 | = | 1 | remainder ( 29 ) | ||||||||||||||
| 125 | : | 29 | = | 4 | remainder ( 9 ) | ||||||||||||||
| 29 | : | 9 | = | 3 | remainder ( 2 ) | ||||||||||||||
| 9 | : | 2 | = | 4 | 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.