Method
GCD uses the Euclidean algorithm; LCM derives from the GCD.
Compute greatest common divisor and least common multiple for two integers.
Updated
GCD: 12
LCM: 72
Quick start
Enter input and view computed output.
Paste or type data.
Run the analysis instantly.
Copy result for workflow use.
In-depth guide
Compute greatest common divisor and least common multiple for two integers.
GCD uses the Euclidean algorithm; LCM derives from the GCD.
Common in fractions, scheduling cycles and modular arithmetic.
Use this calculator for quick everyday estimates, date math, percentages, bill splitting, or simple planning. Use an official source or domain-specific calculator when legal, billing, payroll, or compliance accuracy is required.
Browser-first by design. The tool page explains any exception before you use it.
Your calculator inputs and results stay in the browser session. EpitomeTool does not upload dates, bill amounts, percentages, or copied results to a server.
The greatest common divisor is the largest integer dividing both numbers.
The least common multiple is the smallest positive common multiple.
Yes, absolute values are used for calculation.
Keep exploring
Hand-picked utilities that pair well with the one you're on — all free, client-side, and zero-signup.
Shrink PDF file size without uploading to a server.
Body Mass Index with metric / imperial inputs and WHO category bands.
Combine multiple PDFs into one in your browser.
Split a PDF by pages or page ranges, download as zip.