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