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