The GCD of given numbers is 1.
Step 1 :
Divide $ 3149 $ by $ 2598 $ and get the remainder
The remainder is positive ($ 551 > 0 $), so we will continue with division.
Step 2 :
Divide $ 2598 $ by $ \color{blue}{ 551 } $ and get the remainder
The remainder is still positive ($ 394 > 0 $), so we will continue with division.
Step 3 :
Divide $ 551 $ by $ \color{blue}{ 394 } $ and get the remainder
The remainder is still positive ($ 157 > 0 $), so we will continue with division.
Step 4 :
Divide $ 394 $ by $ \color{blue}{ 157 } $ and get the remainder
The remainder is still positive ($ 80 > 0 $), so we will continue with division.
Step 5 :
Divide $ 157 $ by $ \color{blue}{ 80 } $ and get the remainder
The remainder is still positive ($ 77 > 0 $), so we will continue with division.
Step 6 :
Divide $ 80 $ by $ \color{blue}{ 77 } $ and get the remainder
The remainder is still positive ($ 3 > 0 $), so we will continue with division.
Step 7 :
Divide $ 77 $ by $ \color{blue}{ 3 } $ and get the remainder
The remainder is still positive ($ 2 > 0 $), so we will continue with division.
Step 8 :
Divide $ 3 $ by $ \color{blue}{ 2 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 9 :
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.
| 3149 | : | 2598 | = | 1 | remainder ( 551 ) | ||||||||||||||||
| 2598 | : | 551 | = | 4 | remainder ( 394 ) | ||||||||||||||||
| 551 | : | 394 | = | 1 | remainder ( 157 ) | ||||||||||||||||
| 394 | : | 157 | = | 2 | remainder ( 80 ) | ||||||||||||||||
| 157 | : | 80 | = | 1 | remainder ( 77 ) | ||||||||||||||||
| 80 | : | 77 | = | 1 | remainder ( 3 ) | ||||||||||||||||
| 77 | : | 3 | = | 25 | remainder ( 2 ) | ||||||||||||||||
| 3 | : | 2 | = | 1 | 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.