The GCD of given numbers is 2.
Step 1 :
Divide $ 2020 $ by $ 458 $ and get the remainder
The remainder is positive ($ 188 > 0 $), so we will continue with division.
Step 2 :
Divide $ 458 $ by $ \color{blue}{ 188 } $ and get the remainder
The remainder is still positive ($ 82 > 0 $), so we will continue with division.
Step 3 :
Divide $ 188 $ by $ \color{blue}{ 82 } $ and get the remainder
The remainder is still positive ($ 24 > 0 $), so we will continue with division.
Step 4 :
Divide $ 82 $ by $ \color{blue}{ 24 } $ and get the remainder
The remainder is still positive ($ 10 > 0 $), so we will continue with division.
Step 5 :
Divide $ 24 $ by $ \color{blue}{ 10 } $ and get the remainder
The remainder is still positive ($ 4 > 0 $), so we will continue with division.
Step 6 :
Divide $ 10 $ 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.
| 2020 | : | 458 | = | 4 | remainder ( 188 ) | ||||||||||||
| 458 | : | 188 | = | 2 | remainder ( 82 ) | ||||||||||||
| 188 | : | 82 | = | 2 | remainder ( 24 ) | ||||||||||||
| 82 | : | 24 | = | 3 | remainder ( 10 ) | ||||||||||||
| 24 | : | 10 | = | 2 | remainder ( 4 ) | ||||||||||||
| 10 | : | 4 | = | 2 | 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.