The GCD of given numbers is 34.
Step 1 :
Divide $ 170 $ by $ 136 $ and get the remainder
The remainder is positive ($ 34 > 0 $), so we will continue with division.
Step 2 :
Divide $ 136 $ by $ \color{blue}{ 34 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 34 }} $.
We can summarize an algorithm into a following table.
| 170 | : | 136 | = | 1 | remainder ( 34 ) | ||
| 136 | : | 34 | = | 4 | remainder ( 0 ) | ||
| GCD = 34 | |||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.