LCM & GCD Lommeregner

Find det mindste fælles multiplum og den største fælles divisor af to eller flere heltal.

Enter Numbers (comma-separated)

LCM and GCD Calculator — Frequently Asked Questions

GCD (greatest common divisor) is the largest number that divides all inputs; LCM (least common multiple) is the smallest number they all divide into.

The tool uses the Euclidean algorithm to find the GCD, then derives the LCM from the product divided by the GCD.

Yes, you can compute the LCM and GCD of several numbers at once.