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