Find Greatest Common Divisor of 2 and 67, using Euclidean algorithm.
Answer
The GCD of given numbers is 1.
Explanation
Step 1 :
Divide $ 67 $ by $ 2 $ and get the remainder
The remainder is positive ($ 1 > 0 $), so we will continue with division.
Step 2 :
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.
| 67 | : | 2 | = | 33 | 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.
This page was created using
GCD Calculator