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