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