Step 1 :
Divide $ 1357 $ by $ 546 $ and get the remainder

$$ 1357 : 546 = 2 \text{ ( remainder is } \color{blue}{ 265 } \text{ ) } $$

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

Step 2 :
Divide $ 546 $ by $ \color{blue}{ 265 } $ and get the remainder

$$ 546 : 265 = 2 \text{ ( remainder is } \color{blue}{ 16 } \text{ ) } $$

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

Step 3 :
Divide $ 265 $ by $ \color{blue}{ 16 } $ and get the remainder

$$ 265 : 16 = 16 \text{ ( remainder is } \color{blue}{ 9 } \text{ ) } $$

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

Step 4 :
Divide $ 16 $ by $ \color{blue}{ 9 } $ and get the remainder

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

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

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

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

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

Step 6 :
Divide $ 7 $ by $ \color{blue}{ 2 } $ and get the remainder

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

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

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

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