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