Find Greatest Common Divisor of 133 and 28, using Euclidean algorithm.
Answer
The GCD of given numbers is 7.
Explanation
Step 1 :
Divide $ 133 $ by $ 28 $ and get the remainder
The remainder is positive ($ 21 > 0 $), so we will continue with division.
Step 2 :
Divide $ 28 $ by $ \color{blue}{ 21 } $ and get the remainder
The remainder is still positive ($ 7 > 0 $), so we will continue with division.
Step 3 :
Divide $ 21 $ by $ \color{blue}{ 7 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 7 }} $.
We can summarize an algorithm into a following table.
| 133 | : | 28 | = | 4 | remainder ( 21 ) | ||||
| 28 | : | 21 | = | 1 | remainder ( 7 ) | ||||
| 21 | : | 7 | = | 3 | remainder ( 0 ) | ||||
| GCD = 7 | |||||||||
This solution can be visualized using a Venn diagram.
The GCD equals the product of the numbers at the intersection.
This page was created using
GCD Calculator