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