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