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