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