Question
Find Greatest Common Divisor of 6 and 33, using Euclidean algorithm.
Answer
The GCD of given numbers is 3.
Explanation
Step 1 :
Divide by and get the remainder
The remainder is positive (), so we will continue with division.
Step 2 :
Divide by and get the remainder
The remainder is zero => GCD is the last divisor .
We can summarize an algorithm into a following table.
| 33 | : | 6 | = | 5 | remainder ( 3 ) | ||
| 6 | : | 3 | = | 2 | remainder ( 0 ) | ||
| GCD = 3 | |||||||
This solution can be visualized using a Venn diagram.
0,0
6
33
3
2
11
The GCD equals the product of the numbers at the intersection.
This page was created using
GCD Calculator