GCD & LCM Calculator
Greatest common divisor and least common multiple of several numbers.
Inputs
- Numbers
How it is calculated
Euclid's algorithm; LCM(a,b) = a × b ÷ GCD(a,b).
Greatest common divisor and least common multiple of several numbers.
Euclid's algorithm; LCM(a,b) = a × b ÷ GCD(a,b).