Step 1 :
Divide $ 16690 $ by $ 11690 $ and get the remainder

$$ 16690 : 11690 = 1 \text{ ( remainder is } \color{blue}{ 5000 } \text{ ) } $$

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

Step 2 :
Divide $ 11690 $ by $ \color{blue}{ 5000 } $ and get the remainder

$$ 11690 : 5000 = 2 \text{ ( remainder is } \color{blue}{ 1690 } \text{ ) } $$

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

Step 3 :
Divide $ 5000 $ by $ \color{blue}{ 1690 } $ and get the remainder

$$ 5000 : 1690 = 2 \text{ ( remainder is } \color{blue}{ 1620 } \text{ ) } $$

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

Step 4 :
Divide $ 1690 $ by $ \color{blue}{ 1620 } $ and get the remainder

$$ 1690 : 1620 = 1 \text{ ( remainder is } \color{blue}{ 70 } \text{ ) } $$

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

Step 5 :
Divide $ 1620 $ by $ \color{blue}{ 70 } $ and get the remainder

$$ 1620 : 70 = 23 \text{ ( remainder is } \color{blue}{ 10 } \text{ ) } $$

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

Step 6 :
Divide $ 70 $ by $ \color{blue}{ 10 } $ and get the remainder

$$ 70 : \color{blue}{ \boxed { 10 }} = 7 \text{ ( remainder is } \color{blue}{ 0 } \text{ ) } $$

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

This solution can be visualized using a Venn diagram.

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

GCD Calculator