GCD/LCM Calculator
Free online GCD/LCM Calculator.
Calculator
How to Use
- Enter the required values
- Click Calculate to see the result
- Review the detailed output
Formula
GCD: Euclidean algorithm - GCD(a,b) = GCD(b, a mod b). LCM = (a x b) / GCD(a,b). GCD divides both numbers; LCM is smallest number both divide into.
Example Calculations
Find GCD
Input: Numbers: 24 and 36
Result: GCD: 12
Find LCM
Input: Numbers: 8 and 12
Result: LCM: 24
Both
Input: Numbers: 15 and 20
Result: GCD: 5, LCM: 60
About This Calculator
Free online gcd lcm calculator. Calculate instantly in your browser with our easy-to-use tool. No sign-up required.
Our gcd/lcm calculator is free, easy to use, and provides instant results. All calculations are performed in your browser for privacy and speed.
Related Calculators
Frequently Asked Questions
What is GCD?
Greatest Common Divisor: largest integer dividing two numbers without remainder. GCD(12,18) = 6.
What is LCM?
Least Common Multiple: smallest integer divisible by both numbers. LCM(4,6) = 12.
Find GCD?
Euclidean algorithm: divide larger by smaller, replace with remainder, repeat until 0.
GCD and LCM relationship?
GCD(a,b) x LCM(a,b) = a x b. Find LCM from GCD: LCM = (a x b) / GCD.
Practical uses?
GCD simplifies fractions. LCM finds common denominators, synchronizes events, gear ratios.