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