🟢Least Common Multiple Calculator
Find the least common multiple (LCM) of two or more integers. Uses BigInt for arbitrary precision. Also shows prime factorizations, step-by-step workings, and the relationship LCM × GCF = product of two numbers.
Prefer to skip the form? Scroll down and Ask AI Instead. Just describe your situation and let AI handle the math for you in seconds.
Least Common Multiple
72
Input Numbers vs LCM
✦ Ask AI Instead
Least Common Multiple Calculator: LCM Explained with Examples
The least common multiple (LCM) is the smallest positive integer that is divisible by each of the given numbers. LCM(4, 6) = 12 because 12 is the smallest number that is both a multiple of 4 and a multiple of 6. The LCM is always ≥ the largest input and is related to the GCF by: LCM(a,b) × GCF(a,b) = a × b.
Formula: LCM(a, b) = |a × b| / GCF(a, b)
| Numbers | GCF | LCM |
|---|---|---|
| 4, 6 | 2 | 12 |
| 12, 18, 24 | 6 | 72 |
| 7, 11 | 1 | 77 |
Our least common multiple calculator uses BigInt arithmetic for exact results on arbitrarily large numbers. Enter two or more integers separated by commas, and the calculator returns the LCM along with prime factorizations, step-by-step workings, and the first several multiples of the LCM.
Three Methods to Find the LCM
1. Listing multiples: List the multiples of each number and find the first one they share. Multiples of 4: 4, 8, 12, 16, 20… Multiples of 6: 6, 12, 18, 24… The first shared multiple is 12 = LCM(4, 6). Simple but slow for larger numbers.
2. Prime factorization: Factor each number into prime powers. LCM = product of each prime raised to its maximum exponent across all inputs. For 12 = 2²×3 and 18 = 2×3²: LCM = 2^max(2,1) × 3^max(1,2) = 2²×3² = 4×9 = 36. More elegant and efficient for hand calculation.
3. GCF reduction: Use LCM(a,b) = |a×b| / GCF(a,b). Since GCF is computed efficiently with the Euclidean algorithm, this is the fastest method for large numbers. For 12 and 18: GCF(12,18)=6; LCM = (12×18)/6 = 216/6 = 36. This avoids large intermediate products and is how this calculator works internally.
Why the LCM is Essential for Fractions
Adding or subtracting fractions requires a common denominator — and the LCM of the denominators is the least common denominator (LCD), minimizing the size of numbers you work with. To add 1/12 + 1/18: LCD = LCM(12,18) = 36; 1/12 = 3/36; 1/18 = 2/36; sum = 5/36. Using a non-LCM common denominator (like 216 = 12×18) works but produces a fraction that then needs simplification. The LCM eliminates this extra step.
The GCF–LCM Relationship
For any two positive integers a and b: GCF(a,b) × LCM(a,b) = a × b. This beautiful identity has a simple proof from prime factorizations: for each prime p, min(e1,e2) + max(e1,e2) = e1 + e2. It means knowing any three of the four values (a, b, GCF, LCM) determines the fourth. Example: if a=12, GCF=6, LCM=36, then b = (GCF×LCM)/a = (6×36)/12 = 18. This identity extends to the formula LCM(a,b) = |a×b|/GCF(a,b) used in computation. Note: this identity does NOT generalize simply to three or more numbers — GCF×LCM ≠ product for three numbers.
LCM in Music and Periodic Events
The LCM describes when periodic events synchronize. Two gears with 12 and 18 teeth mesh at the same position every LCM(12,18) = 36 tooth-cycles. In music, a rhythm of 3 beats against 4 beats repeats every LCM(3,4) = 12 beats — the basis of polyrhythm. In astronomy, the Saros cycle predicts eclipses by finding when orbital periods approximately synchronize. If one satellite orbits every 4 hours and another every 6 hours, they align every LCM(4,6) = 12 hours from a starting position.
Frequently Asked Questions
What is the least common multiple?
The least common multiple (LCM) of two or more integers is the smallest positive integer that is a multiple of every number in the set. For example, LCM(4, 6) = 12 because: multiples of 4 are 4, 8, 12, 16, 20… and multiples of 6 are 6, 12, 18, 24… The smallest number in both lists is 12. Every other common multiple is a multiple of the LCM: 24, 36, 48… The LCM is always at least as large as the largest input, and equals the product of the inputs only when they are coprime (GCF = 1).
How do I find the LCM of 12, 18, and 24?
Step 1: LCM(12, 18). GCF(12, 18) = 6; LCM = (12 × 18) / 6 = 36. Step 2: LCM(36, 24). GCF(36, 24) = 12; LCM = (36 × 24) / 12 = 72. So LCM(12, 18, 24) = 72. Verification: 72 ÷ 12 = 6 ✓; 72 ÷ 18 = 4 ✓; 72 ÷ 24 = 3 ✓. Using prime factorizations: 12=2²×3, 18=2×3², 24=2³×3. LCM = 2^max(2,1,3) × 3^max(1,2,1) = 2³×3² = 8×9 = 72.
What is the relationship between LCM and GCF?
For any two positive integers a and b: GCF(a, b) × LCM(a, b) = a × b. This identity is extremely useful — it lets you compute LCM using GCF: LCM(a, b) = a × b / GCF(a, b). Example: LCM(48, 72) = (48 × 72) / GCF(48, 72) = 3456 / 24 = 144. The GCF captures what the numbers share in common (minimum prime exponents), while the LCM captures the union of their prime factors (maximum prime exponents). Their product captures the full product because min + max = sum of exponents.
Why is the LCM used for adding fractions?
To add fractions with different denominators, you need a common denominator — a number divisible by both denominators. Using the LCM (the least common denominator, LCD) keeps the numbers as small as possible. For 5/12 + 7/18: LCD = LCM(12,18) = 36. Convert: 5/12 = 15/36 and 7/18 = 14/36. Sum = 29/36. Using a larger common denominator like 216 = 12×18 would work — you'd get 90/216 + 84/216 = 174/216 — but then you'd need to simplify by dividing by GCF(174, 216) = 6, giving 29/36. The LCD method avoids this extra simplification step.
Can the LCM of two numbers ever equal their product?
Yes — when the two numbers are coprime (GCF = 1). Since LCM(a, b) = a × b / GCF(a, b), if GCF = 1 then LCM = a × b. Examples: LCM(7, 11) = 77 = 7 × 11 (both prime and different); LCM(8, 15) = 120 = 8 × 15 (8=2³, 15=3×5, no shared primes). Conversely, when the numbers share factors, LCM < product: LCM(6, 10) = 30 < 60 = 6 × 10 because GCF(6, 10) = 2. The extreme case: LCM(n, n) = n (any number with itself, since GCF = n, product/GCF = n²/n = n).