GCD & LCM Calculator
Use this GCD and LCM calculator to find the greatest common divisor and least common multiple of 2 or 3 integers. These values are especially useful when simplifying fractions, comparing multiples, solving school math exercises and working with divisibility. The calculator uses the Euclidean algorithm for quick and reliable results.
Frequently Asked Questions
The GCD is used to simplify fractions, solve Diophantine equations, and in cryptography (RSA). For example, to simplify 48/18: GCD=6, so 48/18 = 8/3.
The LCM is often used to find a common denominator for fractions, coordinate repeating cycles and solve scheduling problems where events repeat at different intervals.
How this calculator works
Formula explanation
**GCD:** Euclidean algorithm — gcd(a,b) = gcd(b, a mod b) until b=0 | **LCM:** lcm(a,b) = |a×b| / gcd(a,b)
Worked example
**Example:** GCD(48, 18) = 6 | LCM(48, 18) = 144
Explore more tools in this category
See all calculators in Mathematics.
Continue with related calculators
If you need a nearby calculation or want to compare a related result, these pages are the next best places to continue.
Related Calculators
Discover similar tools to continue your calculation or compare related results.