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