Step 1 :
Divide $ 136 $ by $ 60 $ and get the remainder

$$ 136 : 60 = 2 \text{ ( remainder is } \color{blue}{ 16 } \text{ ) } $$

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

Step 2 :
Divide $ 60 $ by $ \color{blue}{ 16 } $ and get the remainder

$$ 60 : 16 = 3 \text{ ( remainder is } \color{blue}{ 12 } \text{ ) } $$

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

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

$$ 16 : 12 = 1 \text{ ( remainder is } \color{blue}{ 4 } \text{ ) } $$

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

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

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

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

This solution can be visualized using a Venn diagram.

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

GCD Calculator