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