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