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