GCD and LCM Calculator
Find the greatest common divisor and least common multiple for two to six nonzero integers, with Euclidean algorithm steps and prime factorization.
GCD and LCM with steps
English search intent for this page combines GCD, GCF, HCF, and LCM terminology. Users usually want both answers, a quick check, and enough steps to understand the Euclidean algorithm and prime-factor method.
For two nonzero integers, GCD and LCM are tied through the product of the two numbers.
- Enter two to six nonzero integers.
- Use the Euclidean algorithm steps to verify the GCD.
- Use prime factorization to see why the LCM includes the highest exponent of each prime.
GCD, GCF, HCF, and LCM terminology
| Term | Meaning |
|---|---|
| GCD | Greatest common divisor |
| GCF | Greatest common factor, the same idea as GCD for positive integers |
| HCF | Highest common factor, common in UK-style wording |
| LCM | Least common multiple |
Frequently Asked Questions
Sources and References
- LCM Calculator - Least Common MultipleCalculatorSoup
- GCD Calculator that shows stepsMathPortal
- Greatest Common DivisorWolfram MathWorld
- Least Common MultipleWolfram MathWorld
Calculations are based on the listed reference sources. Links open in a new tab.
Related Tools
Calculate the greatest common divisor, also called GCF or HCF, for two or more positive integers with Euclidean algorithm steps and Bezout coefficients for pairs.
Find the least common multiple for two or more positive integers with pairwise GCD steps and prime factorization.
Break an integer into prime factors, see repeated factors, canonical exponent form, trial-division steps, and the total number of positive factors.
Find all positive factors of a number, factor pairs, prime factorization, factor count, sum of factors, proper factors, and number type.
Check whether a whole number is prime, composite, 0, or 1. Shows the smallest factor for composite numbers and links to full factorization.