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