Question
Find Greatest Common Divisor of 11391 and 5673, 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.
| 11391 | : | 5673 | = | 2 | remainder ( 45 ) | ||||
| 5673 | : | 45 | = | 126 | remainder ( 3 ) | ||||
| 45 | : | 3 | = | 15 | remainder ( 0 ) | ||||
| GCD = 3 | |||||||||
This solution can be visualized using a Venn diagram.
0,0
11391
5673
3
3797
31
61
The GCD equals the product of the numbers at the intersection.
This page was created using
GCD Calculator