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