The GCD of given numbers is 22.
Step 1 :
Divide $ 1870 $ by $ 264 $ and get the remainder
The remainder is positive ($ 22 > 0 $), so we will continue with division.
Step 2 :
Divide $ 264 $ 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.
| 1870 | : | 264 | = | 7 | remainder ( 22 ) | ||
| 264 | : | 22 | = | 12 | remainder ( 0 ) | ||
| GCD = 22 | |||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.