Find Greatest Common Divisor of 6120 and 3000, using Euclidean algorithm.
Answer
The GCD of given numbers is 120.
Explanation
Step 1 :
Divide $ 6120 $ by $ 3000 $ and get the remainder
The remainder is positive ($ 120 > 0 $), so we will continue with division.
Step 2 :
Divide $ 3000 $ by $ \color{blue}{ 120 } $ and get the remainder
The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 120 }} $.
We can summarize an algorithm into a following table.
| 6120 | : | 3000 | = | 2 | remainder ( 120 ) | ||
| 3000 | : | 120 | = | 25 | remainder ( 0 ) | ||
| GCD = 120 | |||||||
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