GCD & LCM Calculator β with steps
Find the greatest common divisor and least common multiple of several integers, with the Euclidean steps.
π Runs entirely in your browser. Your input and output are never sent to a server or stored β fully private.
Enter two or more whole numbers, separated by commas or spaces. Click GCD or LCM to copy.
About this tool
This GCD and LCM calculator finds the greatest common divisor and least common multiple of two or more whole numbers at once. It shows the Euclidean algorithm step by step for the GCD and uses it to derive the LCM, so you can follow the reasoning rather than just copy the answer. The calculation runs entirely in your browser.
Frequently asked questions
What is the difference between GCD and LCM?
The greatest common divisor is the largest number that divides every one of your inputs without a remainder, while the least common multiple is the smallest number they all divide into. For two numbers the two are linked, since the GCD multiplied by the LCM equals the product of the numbers.
Can it handle more than two numbers?
Yes. Enter as many whole numbers as you like, separated by spaces or commas, and the calculator finds the GCD and LCM of the whole set by applying the Euclidean algorithm to them in turn.
Is my data sent anywhere?
No. The numbers you enter are processed only in your browser, so they are never sent to or stored on any server.