The GCD of given numbers is 1.
Step 1 :
Divide $ 345 $ by $ 217 $ and get the remainder
The remainder is positive ($ 128 > 0 $), so we will continue with division.
Step 2 :
Divide $ 217 $ by $ \color{blue}{ 128 } $ and get the remainder
The remainder is still positive ($ 89 > 0 $), so we will continue with division.
Step 3 :
Divide $ 128 $ by $ \color{blue}{ 89 } $ and get the remainder
The remainder is still positive ($ 39 > 0 $), so we will continue with division.
Step 4 :
Divide $ 89 $ by $ \color{blue}{ 39 } $ and get the remainder
The remainder is still positive ($ 11 > 0 $), so we will continue with division.
Step 5 :
Divide $ 39 $ by $ \color{blue}{ 11 } $ and get the remainder
The remainder is still positive ($ 6 > 0 $), so we will continue with division.
Step 6 :
Divide $ 11 $ by $ \color{blue}{ 6 } $ and get the remainder
The remainder is still positive ($ 5 > 0 $), so we will continue with division.
Step 7 :
Divide $ 6 $ by $ \color{blue}{ 5 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 8 :
Divide $ 5 $ 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.
| 345 | : | 217 | = | 1 | remainder ( 128 ) | ||||||||||||||
| 217 | : | 128 | = | 1 | remainder ( 89 ) | ||||||||||||||
| 128 | : | 89 | = | 1 | remainder ( 39 ) | ||||||||||||||
| 89 | : | 39 | = | 2 | remainder ( 11 ) | ||||||||||||||
| 39 | : | 11 | = | 3 | remainder ( 6 ) | ||||||||||||||
| 11 | : | 6 | = | 1 | remainder ( 5 ) | ||||||||||||||
| 6 | : | 5 | = | 1 | remainder ( 1 ) | ||||||||||||||
| 5 | : | 1 | = | 5 | remainder ( 0 ) | ||||||||||||||
| GCD = 1 | |||||||||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.