GCD & LCM Calculator
Compute the greatest common divisor and least common multiple of two integers.
Input Data
A
B
Results
Greatest common divisor.
6
Least common multiple.
144
Explanatory note about the result.
gcd(48,18)=6；lcm=144
At a glance:gcd by Euclid (gcd(a,b)=gcd(b, a mod b)); lcm(a,b)=|a·b|/gcd(a,b). Complements factoring and modulo.
Formula
lcm(a,b) = |a·b| / gcd(a,b).
How to Use
- Enter a and b.
- The tool returns gcd and lcm.
Case Studies
a=12, b=18
gcd=6; lcm=36.
FAQ
Relation of gcd and lcm?
Their product equals |a·b|.
Related Tools
References
Content review: Calculatorism Science Team. Results are for reference only; please refer to the relevant authorities for the official figures.