Online greatest common divisor and least common multiple calculator: enter several integers to find the GCD and LCM with the Euclidean algorithm and show the calculation steps, supporting large integers—great for math study and checking homework.
Greatest common divisor
—
Least common multiple
—
Calculated using the Euclidean algorithm, supports arbitrarily large integers, all processed locally on your device.
Share this result
Create a short link so you can reopen or download the result on other devices.
Share this result
Create a short link so you can reopen or download the result on other devices.