Math & Statistics Tools
GCD / LCM Calculator
Calculate GCD and LCM of two or more numbers using the Euclidean algorithm.
Loading tool…
What is GCD/LCM?
GCD is the largest number that divides all inputs evenly. LCM is the smallest number divisible by all inputs. GCD x LCM = product of the two numbers.
How it works
We reduce the list pairwise using Euclid algorithm: GCD(a,b) = GCD(b, a%b) until b=0. LCM(a,b) = |a x b| / GCD(a,b).
- Enter your input. Type or paste your input into the field above — the tool responds instantly.
- Review the result. Output updates live as you type. Everything runs entirely in your browser.
- Copy or download. Use the Copy button to grab the result, or Download to save it as a file.
Examples
Realistic sample
Type or paste any realistic input — the tool computes the result locally and instantly.
Common mistakes
Expecting a server round-trip
Nothing is uploaded — every tool in this category runs entirely in your browser.