LCM Calculator
Find the Least Common Multiple (LCM / LCD) of two or more numbers using prime factorization and common divisor methods.
All formulas and computation matrices for this calculator execute directly in your browser with zero latency. Enter your parameters to see instant results.
Who Uses This Calculation & Why Accuracy Matters
Software engineers, event schedulers, mathematicians, students, and astronomers use this Least Common Multiple (LCM) calculator to find the smallest positive integer divisible by two or more numbers using Prime Factorization, the Euclidean GCF Algorithm, or the Cake/Ladder method.
An astronomer calculating when three orbiting moons with orbital periods of 12 days, 18 days, and 30 days will align in a straight line.
A food manufacturer packaging hot dogs sold in packs of 10 with hot dog buns sold in packs of 8 with zero leftover items.
A DevOps engineer synchronizing three scheduled cloud tasks that run every 15 minutes, 20 minutes, and 45 minutes.
Common Integer Pairs & Their GCF / LCM Relationships
Demonstrating the fundamental relationship: LCM(a, b) × GCF(a, b) = a × b.
| Integer Pair (a, b) | Prime Factorization a | Prime Factorization b | GCF(a, b) | LCM(a, b) | Product (a × b) |
|---|---|---|---|---|---|
| 8 and 12 | 2³ | 2² × 3 | 4 | 24 | 96 (4 × 24 = 96) |
| 15 and 25 | 3 × 5 | 5² | 5 | 75 | 375 (5 × 75 = 375) |
| 14 and 35 | 2 × 7 | 5 × 7 | 7 | 70 | 490 (7 × 70 = 490) |
| 9 and 28 (Co-prime) | 3² | 2² × 7 | 1 | 252 | 252 (1 × 252 = 252) |
| 16 and 48 (Multiple) | 2⁴ | 2⁴ × 3 | 16 | 48 | 768 (16 × 48 = 768) |
| 18 and 24 | 2 × 3² | 2³ × 3 | 6 | 72 | 432 (6 × 72 = 432) |
* Co-prime integers have a GCF of 1, meaning their LCM is simply their direct product.
LCM Prime Factorization & Euclidean GCF Equations
The LCM of two integers a and b is their absolute product divided by their Greatest Common Factor (GCF). Via prime factorization, LCM takes the highest power of every prime factor present.
Non-zero integer inputs.
The largest integer dividing both a and b without remainder.
Unique prime numbers dividing the inputs.
Step-by-Step Worked Examples with Real Numbers
Worked Example 1: Finding LCM of 24 and 36 via Prime Factorization
Prime factors of 24.
Prime factors of 36.
Union of highest powers.
Least Common Multiple is 72.
Worked Example 2: Finding LCM of Three Numbers (12, 15, 20)
Intermediate LCM.
Final combined LCM is 60.
Assumptions, Edge Cases & Common Calculation Mistakes
ℹ Underlying Algorithm Assumptions
- Assumes integer inputs; if negative numbers are entered, LCM is positive by definition: LCM(a, b) > 0.
- Assumes non-zero inputs; LCM(a, 0) is conventionally defined as 0.
- Assumes associative property holds: LCM(a, b, c) = LCM(LCM(a, b), c).
⚠ 3 Common Mistakes to Avoid
- Multiplying all numbers together and assuming that is the LCM; direct multiplication only equals LCM if all numbers are mutually co-prime.
- Confusing LCM (which is always greater than or equal to the largest number) with GCF (which is less than or equal to the smallest).
- Attempting to calculate LCM of non-integer real decimals without clearing denominators first.