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