GCD & LCM Calculator
// Calculate greatest common divisor and least common multiple
6
36
Numbers: 12, 18
#About GCD & LCM Calculator
Free online GCD and LCM calculator. Find the greatest common divisor and least common multiple of two or more numbers using the Euclidean algorithm. This tool runs entirely in your browser — your data is never sent to a server. Just paste your input, get instant results, and copy with one click. No sign-up or installation required.
#FAQ
What is the Euclidean algorithm? ▾
The Euclidean algorithm finds the GCD of two numbers by repeatedly dividing the larger by the smaller and taking the remainder, until the remainder is zero. The last non-zero remainder is the GCD.
How are GCD and LCM related? ▾
For any two positive integers a and b: LCM(a, b) = (a × b) / GCD(a, b). This relationship makes it efficient to compute both values together.
</> Embed this tool ▾
Copy this code to embed the tool on your website. Adjust the height to fit your layout.
<iframe src="https://www.browserutils.dev/embed/gcd-lcm-calculator" width="100%" height="500" frameborder="0" title="GCD & LCM Calculator"></iframe>