Find Greatest Common Divisor of 66 and 11, using Euclidean algorithm.
Answer
The GCD of given numbers is 11.
Explanation
Step 1 :
Divide $ 66 $ by $ 11 $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 11 }} $.
We can summarize an algorithm into a following table.
| 66 | : | 11 | = | 6 | remainder ( 0 ) |
| GCD = 11 | |||||
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