Step 1 :
Divide $ 16390 $ by $ 11390 $ and get the remainder

$$ 16390 : 11390 = 1 \text{ ( remainder is } \color{blue}{ 5000 } \text{ ) } $$

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

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

$$ 11390 : 5000 = 2 \text{ ( remainder is } \color{blue}{ 1390 } \text{ ) } $$

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

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

$$ 5000 : 1390 = 3 \text{ ( remainder is } \color{blue}{ 830 } \text{ ) } $$

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

Step 4 :
Divide $ 1390 $ by $ \color{blue}{ 830 } $ and get the remainder

$$ 1390 : 830 = 1 \text{ ( remainder is } \color{blue}{ 560 } \text{ ) } $$

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

Step 5 :
Divide $ 830 $ by $ \color{blue}{ 560 } $ and get the remainder

$$ 830 : 560 = 1 \text{ ( remainder is } \color{blue}{ 270 } \text{ ) } $$

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

Step 6 :
Divide $ 560 $ by $ \color{blue}{ 270 } $ and get the remainder

$$ 560 : 270 = 2 \text{ ( remainder is } \color{blue}{ 20 } \text{ ) } $$

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

Step 7 :
Divide $ 270 $ by $ \color{blue}{ 20 } $ and get the remainder

$$ 270 : 20 = 13 \text{ ( remainder is } \color{blue}{ 10 } \text{ ) } $$

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

Step 8 :
Divide $ 20 $ by $ \color{blue}{ 10 } $ and get the remainder

$$ 20 : \color{blue}{ \boxed { 10 }} = 2 \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