Step 1 :
Divide $ 2210 $ by $ 1131 $ and get the remainder

$$ 2210 : 1131 = 1 \text{ ( remainder is } \color{blue}{ 1079 } \text{ ) } $$

The remainder is positive ($ 1079 > 0 $), so we will continue with division.

Step 2 :
Divide $ 1131 $ by $ \color{blue}{ 1079 } $ and get the remainder

$$ 1131 : 1079 = 1 \text{ ( remainder is } \color{blue}{ 52 } \text{ ) } $$

The remainder is still positive ($ 52 > 0 $), so we will continue with division.

Step 3 :
Divide $ 1079 $ by $ \color{blue}{ 52 } $ and get the remainder

$$ 1079 : 52 = 20 \text{ ( remainder is } \color{blue}{ 39 } \text{ ) } $$

The remainder is still positive ($ 39 > 0 $), so we will continue with division.

Step 4 :
Divide $ 52 $ by $ \color{blue}{ 39 } $ and get the remainder

$$ 52 : 39 = 1 \text{ ( remainder is } \color{blue}{ 13 } \text{ ) } $$

The remainder is still positive ($ 13 > 0 $), so we will continue with division.

Step 5 :
Divide $ 39 $ by $ \color{blue}{ 13 } $ and get the remainder

$$ 39 : \color{blue}{ \boxed { 13 }} = 3 \text{ ( remainder is } \color{blue}{ 0 } \text{ ) } $$

The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 13 }} $.

This solution can be visualized using a Venn diagram.

The GCD equals the product of the numbers at the intersection.

GCD Calculator