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