The GCD of given numbers is 2.
Step 1 :
Divide $ 3026 $ by $ 258 $ and get the remainder
The remainder is positive ($ 188 > 0 $), so we will continue with division.
Step 2 :
Divide $ 258 $ by $ \color{blue}{ 188 } $ and get the remainder
The remainder is still positive ($ 70 > 0 $), so we will continue with division.
Step 3 :
Divide $ 188 $ by $ \color{blue}{ 70 } $ and get the remainder
The remainder is still positive ($ 48 > 0 $), so we will continue with division.
Step 4 :
Divide $ 70 $ by $ \color{blue}{ 48 } $ and get the remainder
The remainder is still positive ($ 22 > 0 $), so we will continue with division.
Step 5 :
Divide $ 48 $ by $ \color{blue}{ 22 } $ and get the remainder
The remainder is still positive ($ 4 > 0 $), so we will continue with division.
Step 6 :
Divide $ 22 $ by $ \color{blue}{ 4 } $ and get the remainder
The remainder is still positive ($ 2 > 0 $), so we will continue with division.
Step 7 :
Divide $ 4 $ by $ \color{blue}{ 2 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 2 }} $.
We can summarize an algorithm into a following table.
| 3026 | : | 258 | = | 11 | remainder ( 188 ) | ||||||||||||
| 258 | : | 188 | = | 1 | remainder ( 70 ) | ||||||||||||
| 188 | : | 70 | = | 2 | remainder ( 48 ) | ||||||||||||
| 70 | : | 48 | = | 1 | remainder ( 22 ) | ||||||||||||
| 48 | : | 22 | = | 2 | remainder ( 4 ) | ||||||||||||
| 22 | : | 4 | = | 5 | remainder ( 2 ) | ||||||||||||
| 4 | : | 2 | = | 2 | remainder ( 0 ) | ||||||||||||
| GCD = 2 | |||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.