How it works
The GCD is found with Euclid’s algorithm. For two positive integers a and b, LCM(a,b) = |a × b| ÷ GCD(a,b); several integers are combined successively.
Numbers and notation
GCD and LCM Calculator
Enter between two and eight positive integers. The result explains the common divisors, shared multiples and calculation method.
Your resultGCD 42 · LCM 1,260
42 divides every number; 1,260 is their first common positive multiple.
Prime factorizations
84 = 2^2 × 3 × 7126 = 2 × 3^2 × 7210 = 2 × 3 × 5 × 7See Euclid’s algorithm
84 = 0 × 126 + 84126 = 1 × 84 + 4284 = 2 × 42 + 042 = 0 × 210 + 42210 = 5 × 42 + 0- Greatest common divisor
- 42
- Least common multiple
- 1,260
- Numbers analyzed
- 84 · 126 · 210
Understanding your result
The GCD is the largest integer that divides every input without remainder. The LCM is the smallest positive integer divisible by every input.
Last verified:
03FAQ
Frequently asked questions
It is useful for simplifying fractions, dividing quantities into the largest equal groups and identifying common cycles.