Question
Find Greatest Common Divisor of 68 and 32, using Euclidean algorithm.
Answer
The GCD of given numbers is 4.
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.
| 68 | : | 32 | = | 2 | remainder ( 4 ) | ||
| 32 | : | 4 | = | 8 | remainder ( 0 ) | ||
| GCD = 4 | |||||||
This solution can be visualized using a Venn diagram.
0,0
68
32
2
2
17
2
2
2
The GCD equals the product of the numbers at the intersection.
This page was created using
GCD Calculator