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