GCD & LCM Calculator
Compute the greatest common divisor (GCD) and least common multiple (LCM) of any two positive integers instantly, free and 100% in your browser.
100% client-side · no upload
GCD (Greatest Common Divisor)
LCM (Least Common Multiple)
How to use
- Enter two positive integers in the input fields.
- The GCD and LCM update automatically as you type.
- GCD is the largest integer that divides both numbers evenly. LCM is the smallest positive integer divisible by both.
Related tools
- Fraction Calculator — uses GCD internally to simplify
- Prime Factorization
- Prime Number Checker
- Permutation & Combination Calculator
More ways to use this tool
Frequently Asked Questions
- Is this GCD and LCM calculator free?
- Yes, completely free with no signup and no usage limits.
- Does my data leave my device?
- No. The Euclidean algorithm runs entirely in your browser. No data is sent anywhere.
- Does it work on mobile?
- Yes. Works on iPhone Safari and Android Chrome without installing any app.
- What is the difference between GCD and LCM?
- GCD (Greatest Common Divisor) is the largest integer that divides both numbers without a remainder. LCM (Least Common Multiple) is the smallest positive integer that is divisible by both numbers. They are related by: GCD × LCM = a × b.
Last updated: By jarvisbox