Find Greatest Common Divisor of 841 and 160, using Euclidean algorithm.
Answer
The GCD of given numbers is 1.
Explanation
Step 1 :
Divide $ 841 $ by $ 160 $ and get the remainder
The remainder is positive ($ 41 > 0 $), so we will continue with division.
Step 2 :
Divide $ 160 $ by $ \color{blue}{ 41 } $ and get the remainder
The remainder is still positive ($ 37 > 0 $), so we will continue with division.
Step 3 :
Divide $ 41 $ by $ \color{blue}{ 37 } $ and get the remainder
The remainder is still positive ($ 4 > 0 $), so we will continue with division.
Step 4 :
Divide $ 37 $ by $ \color{blue}{ 4 } $ and get the remainder
The remainder is still positive ($ 1 > 0 $), so we will continue with division.
Step 5 :
Divide $ 4 $ 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.
| 841 | : | 160 | = | 5 | remainder ( 41 ) | ||||||||
| 160 | : | 41 | = | 3 | remainder ( 37 ) | ||||||||
| 41 | : | 37 | = | 1 | remainder ( 4 ) | ||||||||
| 37 | : | 4 | = | 9 | remainder ( 1 ) | ||||||||
| 4 | : | 1 | = | 4 | remainder ( 0 ) | ||||||||
| GCD = 1 | |||||||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.