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