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