Step 1 :
Divide $ 373 $ by $ 127 $ and get the remainder

$$ 373 : 127 = 2 \text{ ( remainder is } \color{blue}{ 119 } \text{ ) } $$

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

Step 2 :
Divide $ 127 $ by $ \color{blue}{ 119 } $ and get the remainder

$$ 127 : 119 = 1 \text{ ( remainder is } \color{blue}{ 8 } \text{ ) } $$

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

Step 3 :
Divide $ 119 $ by $ \color{blue}{ 8 } $ and get the remainder

$$ 119 : 8 = 14 \text{ ( remainder is } \color{blue}{ 7 } \text{ ) } $$

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

Step 4 :
Divide $ 8 $ by $ \color{blue}{ 7 } $ and get the remainder

$$ 8 : 7 = 1 \text{ ( remainder is } \color{blue}{ 1 } \text{ ) } $$

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

Step 5 :
Divide $ 7 $ by $ \color{blue}{ 1 } $ and get the remainder

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

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

This solution can be visualized using a Venn diagram.

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

GCD Calculator