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