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