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