GCD and LCM calculator
MathCalculate the greatest common divisor and least common multiple of two integers.
Your results
Find the greatest common divisor and least common multiple.
How GCD and LCM are computed
GCD is computed with the Euclidean algorithm by repeated remainders. LCM is then derived as the product of both numbers divided by their GCD.
Practical uses
GCD simplifies fractions by dividing numerator and denominator. LCM is useful for combining fractions with different denominators or scheduling repeating events.
Frequently asked questions
Answers to the most common questions about this tool.
How is this result calculated?
It applies the mathematical rule shown by this calculator to your inputs.
Can the result be greater than 100%?
Yes, when the relationship between the entered values is larger than the reference value.
What is this calculation useful for?
Use it for quick checks, study, and everyday calculations.
Which values can I enter?
Enter valid numbers in the fields and check any required format.
What happens with zero or invalid values?
The tool prevents or flags operations that are not mathematically defined.
Sources and methodology
Methodology: GCD and LCM
Obtains GCD with the Euclidean algorithm and LCM as |a × b| / GCD.
It truncates inputs to integers and uses absolute values.
References
No external reference is required: the mathematical calculation is described above.
Last reviewed
July 15, 2026