Separate with commas, spaces or new lines. Ctrl+Enter to calculate
Enter a separate set of values in each row to compare their LCMs instantly.
A fast, precise, and beautiful calculator for finding the Least Common Multiple of any set of numbers — with detailed step-by-step working.
BigInt math with no floating-point errors.
Prime factorization and GCD cross-check.
Handles integers, fractions, and decimals.
19 languages supported worldwide.
Speak your numbers using your browser's speech engine.
PNG, PDF, and shareable links.
Built as a single-page, installable web app. All calculations run locally in your browser using BigInt and Pollard's rho factorization. No data is sent to any server.
The Least Common Multiple (LCM) is a foundational concept in mathematics used everywhere from adding fractions to scheduling algorithms. This guide covers everything you need to know: what LCM is, how to find it, the formulas, real-world applications, visual charts, and answers to frequently asked questions.
The Least Common Multiple (LCM) of two or more integers is the smallest positive integer that is evenly divisible by each of them. In other words, it is the lowest number that all the given numbers can divide into without leaving a remainder.
For example, the LCM of 4 and 6 is 12, because:
Visualization of the first 30 multiples of 4 and 6. The first common multiple is 12, so LCM(4, 6) = 12.
Depending on your region or textbook, the LCM may be called:
| Language | Name | Abbreviation | Example |
|---|---|---|---|
| 🇬🇧 English | Least Common Multiple | LCM | LCM(4, 6) = 12 |
| 🇩🇪 German | Kleinstes gemeinsames Vielfaches | kgV | kgV(4, 6) = 12 |
| 🇪🇸 Spanish | Mínimo Común Múltiplo | MCM | MCM(4, 6) = 12 |
| 🇫🇷 French | Plus Petit Commun Multiple | PPCM | PPCM(4, 6) = 12 |
| 🇮🇹 Italian | Minimo Comune Multiplo | mcm | mcm(4, 6) = 12 |
| 🇵🇹 Portuguese | Mínimo Múltiplo Comum | MMC | MMC(4, 6) = 12 |
| 🇷🇺 Russian | Наименьшее общее кратное | НОК | НОК(4, 6) = 12 |
| 🇨🇳 (for reference) | 最小公倍数 | LCM | LCM(4, 6) = 12 |
| 🇯🇵 Japanese | 最小公倍数 | LCM | LCM(4, 6) = 12 |
| 🇮🇳 Hindi | लघुत्तम समापवर्त्य | LCM | LCM(4, 6) = 12 |
| 🇸🇦 Arabic | المضاعف المشترك الأصغر | LCM | LCM(4, 6) = 12 |
| 🇵🇰 Urdu | سب سے چھوٹا مشترکہ ضرب | LCM | LCM(4, 6) = 12 |
There are several equivalent ways to write the LCM formula. The most common one links LCM to GCD (Greatest Common Divisor):
This works because of the fundamental identity:
For fractions, the formula is different:
For more than two numbers, LCM is associative — you can fold the list pairwise:
If each number is broken into prime factors, the LCM is the product of the highest power of every prime appearing in any number:
| Method | Formula | Best For | Complexity |
|---|---|---|---|
| GCD Method | LCM(a, b) = a × b ÷ GCD(a, b) | Two large numbers | O(log min(a,b)) |
| Prime Factorization | LCM = ∏ pmax e | Three or more numbers | O(√n) |
| Listing Multiples | First common multiple | Small numbers (< 20) | O(LCM) |
| Fractions | LCM(nums) ÷ GCD(dens) | Rational numbers | O(√n) |
You can calculate the LCM using any of these three standard methods. Our calculator uses prime factorization internally for the most reliable results.
List the multiples of each number and find the smallest one they share. Best for small numbers.
Break each number into primes, take the highest power of every prime, and multiply.
Use LCM(a, b) = a × b ÷ GCD(a, b). Fastest for large numbers.
Example: Find LCM(6, 8).
| Number | Multiples | First Common |
|---|---|---|
| 6 | 6, 12, 18, 24, 30, … | 24 |
| 8 | 8, 16, 24, 32, … |
Example: Find LCM(12, 18).
Prime factorization of 12 and 18 broken down into their prime factors.
| Number | Prime Factorization | 2 | 3 | Highest |
|---|---|---|---|---|
| 12 | 2² × 3 | 2² | 3¹ | — |
| 18 | 2 × 3² | 2¹ | 3² | — |
| LCM | 2² × 3² | 2² | 3² | 4 × 9 = 36 |
Example: Find LCM(24, 36).
LCM and HCF (also called GCD) are complementary concepts. Understanding both is essential for number theory and fraction work.
For two numbers a and b, the LCM is the union of all prime factors (with highest powers) and the GCD is the intersection (with lowest powers).
| Aspect | LCM — Least Common Multiple | HCF / GCD — Highest Common Factor |
|---|---|---|
| Definition | Smallest number divisible by all given numbers | Largest number that divides all given numbers |
| Relationship | LCM(a, b) × HCF(a, b) = a × b | |
| Size | Always ≥ largest number in the set | Always ≤ smallest number in the set |
| Primary use | Adding/subtracting fractions, scheduling | Simplifying fractions, grouping |
| Example | LCM(12, 18) = 36 | HCF(12, 18) = 6 |
| Verification | 12 × 18 = 216 = 36 × 6 ✓ | |
Visualizations help understand how LCM grows with input size and how different pairs compare.
Bar chart comparing the LCM of frequently asked number pairs. Notice how LCM(a, b) = a × b when a and b are coprime.
When two numbers are coprime (GCD = 1), LCM equals their product. Otherwise, LCM is smaller than the product.
| Pair (a, b) | GCD | a × b | LCM | Coprime? |
|---|---|---|---|---|
| (7, 11) | 1 | 77 | 77 | ✓ Yes |
| (5, 9) | 1 | 45 | 45 | ✓ Yes |
| (8, 9) | 1 | 72 | 72 | ✓ Yes |
| (12, 18) | 6 | 216 | 36 | ✗ No |
| (24, 36) | 12 | 864 | 72 | ✗ No |
| (15, 20) | 5 | 300 | 60 | ✗ No |
To add 1/4 + 1/6, we find the LCD = LCM(4, 6) = 12, then rewrite both fractions with denominator 12.
These properties help you simplify calculations and verify results.
| Property | Formula | Example |
|---|---|---|
| Commutative | LCM(a, b) = LCM(b, a) | LCM(4, 6) = LCM(6, 4) = 12 |
| Associative | LCM(a, LCM(b, c)) = LCM(LCM(a, b), c) | LCM(2, LCM(3, 4)) = 12 |
| Identity | LCM(a, 1) = a | LCM(7, 1) = 7 |
| Idempotent | LCM(a, a) = a | LCM(5, 5) = 5 |
| Divisibility | a | b ⟹ LCM(a, b) = b | 3 | 9 ⟹ LCM(3, 9) = 9 |
| Coprime case | GCD(a, b) = 1 ⟹ LCM(a, b) = a × b | LCM(7, 11) = 77 |
| Bound | max(a, b) ≤ LCM(a, b) ≤ a × b | 6 ≤ LCM(6, 8) = 24 ≤ 48 |
| Distributive | LCM(a, GCD(b, c)) = GCD(LCM(a,b), LCM(a,c)) | LCM(6, GCD(8,12)) = 6 |
A quick reference for frequently asked LCM values. Useful for homework, exams, and cross-checking calculations.
A 12×12 multiplication-style table of LCM values. Read as LCM(row, column).
| · | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
| 2 | 2 | 2 | 6 | 4 | 10 | 6 | 14 | 8 | 18 | 10 | 22 | 12 |
| 3 | 3 | 6 | 3 | 12 | 15 | 6 | 21 | 24 | 9 | 30 | 33 | 12 |
| 4 | 4 | 4 | 12 | 4 | 20 | 12 | 28 | 8 | 36 | 20 | 44 | 12 |
| 5 | 5 | 10 | 15 | 20 | 5 | 30 | 35 | 40 | 45 | 10 | 55 | 60 |
| 6 | 6 | 6 | 6 | 12 | 30 | 6 | 42 | 24 | 18 | 30 | 66 | 12 |
| 7 | 7 | 14 | 21 | 28 | 35 | 42 | 7 | 56 | 63 | 70 | 77 | 84 |
| 8 | 8 | 8 | 24 | 8 | 40 | 24 | 56 | 8 | 72 | 40 | 88 | 24 |
| 9 | 9 | 18 | 9 | 36 | 45 | 18 | 63 | 72 | 9 | 90 | 99 | 36 |
| 10 | 10 | 10 | 30 | 20 | 10 | 30 | 70 | 40 | 90 | 10 | 110 | 60 |
| 11 | 11 | 22 | 33 | 44 | 55 | 66 | 77 | 88 | 99 | 110 | 11 | 132 |
| 12 | 12 | 12 | 12 | 12 | 60 | 12 | 84 | 24 | 36 | 60 | 132 | 12 |
The LCM isn't just a classroom concept — it appears in many practical situations where repeating events need to align.
| Field | Problem | LCM Role | Example |
|---|---|---|---|
| Mathematics | Adding fractions | Find common denominator | 1/4 + 1/6 → 12 |
| Scheduling | Repeating events | When events align | Buses: 12 & 18 min → 36 |
| Mechanics | Gear rotation | Re-alignment point | 24 & 36 teeth → 72 turns |
| Commerce | Package sizes | Equal quantities | Pens 12-pack, pads 18-pack → 36 |
| Music | Rhythm pattern | Pattern re-sync | 4/4 & 3/4 → 12 beats |
| Computer Science | Hash table size | Cycle detection | Hash collisions |
| Finance | Payment cycles | Matching schedules | Weekly & monthly billing |
To add fractions with different denominators, find the LCD (Least Common Denominator), which is the LCM of the denominators.
Example: 1/4 + 1/6. LCM(4, 6) = 12, so rewrite as 3/12 + 2/12 = 5/12.
If two events occur at different intervals, the LCM tells you when they'll happen together again.
Example: A bus leaves every 12 minutes and another every 18 minutes. They'll next depart together after LCM(12, 18) = 36 minutes.
Two gears with 24 and 36 teeth will return to their starting alignment after LCM(24, 36) = 72 revolutions.
If pens come in packs of 12 and notebooks in packs of 18, you need LCM(12, 18) = 36 of each to have equal counts of both.
Drummers use LCM to find when two different rhythmic patterns will align perfectly again.
In hashing, task scheduling, and rate limiters, LCM is used to detect cycles and align periodic processes.
Longer explorations of LCM concepts, history, and advanced applications.
The concept of the Least Common Multiple dates back to ancient civilizations. Babylonian mathematicians were already solving problems equivalent to finding common multiples over 4,000 years ago, using their base-60 sexagesimal number system. Egyptian scribes used LCM-like reasoning when working with fractions in the Rhind Mathematical Papyrus (c. 1650 BCE), where they needed to find common denominators to combine unit fractions.
The Greek mathematician Euclid (c. 300 BCE) described an algorithm in his Elements that is still used today — the Euclidean algorithm for finding the Greatest Common Divisor. Because of the identity LCM(a, b) = a × b ÷ GCD(a, b), Euclid's algorithm indirectly gives us a fast way to compute LCMs, and his book also contains the earliest known proof that every integer has a unique prime factorization.
In India, mathematicians like Aryabhata (5th century CE) and Brahmagupta (7th century CE) developed systematic methods for working with multiples and divisors. The classical Indian kuttaka method for solving linear Diophantine equations relied on reasoning that is closely related to LCM computations. Chinese mathematicians in the Nine Chapters on the Mathematical Art (c. 200 CE) also worked with LCM-equivalent concepts for reducing fractions to common denominators.
Today, LCM is a fundamental tool in number theory, cryptography, computer algorithms, and engineering. Every time you add fractions, synchronize processes, or detect a cycle, you're using a concept that has been refined over four millennia.
In computer science, LCM plays a surprisingly central role. Distributed systems use LCM to synchronize clocks, determine how often periodic tasks coincide, and calculate when two independent event streams will "meet" again. For example, in a system where two processes check for data every 6 and 8 milliseconds respectively, they will both fire together every LCM(6, 8) = 24 milliseconds — which determines the worst-case latency of the combined system.
Hash tables use LCM when resizing. If the table grows to a size divisible by many small numbers, collisions between keys with different hashing patterns occur at LCM-determined intervals. That's why many hash table sizes are chosen as prime numbers or powers of two — to avoid predictable LCM patterns that could cause clustering.
In cryptography, LCM appears in RSA key generation and in the Chinese Remainder Theorem, which reconstructs an integer from its remainders modulo pairwise coprime numbers. The CRT is used in secure multi-party computation, error-correcting codes, and efficient modular exponentiation.
Many students make the same handful of mistakes when learning LCM. Here are the most common, along with why they're wrong:
In ring theory, the LCM of two elements of an integral domain is defined as a generator of the intersection of the principal ideals generated by each element. In a Principal Ideal Domain (PID), LCM and GCD always exist and satisfy the same identity LCM(a, b) × GCD(a, b) = a × b (up to units). This generalization is used in polynomial rings, algebraic number theory, and cryptography based on lattices.
In the integers, LCM corresponds to the "join" operation in the lattice of divisibility, and GCD corresponds to the "meet." Together they form a distributive lattice, which is why the identity LCM(a, GCD(b, c)) = GCD(LCM(a, b), LCM(a, c)) holds.
Three fully solved examples covering different scenarios.
Find LCM(15, 20).
| Step | Action | Result |
|---|---|---|
| 1 | Prime factorize | 15 = 3 × 5; 20 = 2² × 5 |
| 2 | Take highest powers | 2², 3¹, 5¹ |
| 3 | Multiply | 4 × 3 × 5 = 60 |
| ✓ | Verify | 60 ÷ 15 = 4 ✓; 60 ÷ 20 = 3 ✓ |
Find LCM(8, 12, 18).
| Number | Prime Factorization | Highest Power |
|---|---|---|
| 8 | 2³ | 2³ |
| 12 | 2² × 3 | 2², 3¹ |
| 18 | 2 × 3² | 2¹, 3² |
| LCM | 2³ × 3² = 72 | 2³, 3² |
Find LCM(1/2, 3/4, 5/6).
| Step | Action | Result |
|---|---|---|
| 1 | LCM of numerators | LCM(1, 3, 5) = 15 |
| 2 | GCD of denominators | GCD(2, 4, 6) = 2 |
| 3 | Result | 15/2 = 7.5 or 7½ |
Even experienced students make these errors. Watch out for them.
| ❌ Mistake | Why it's wrong | ✅ Correct approach |
|---|---|---|
| Confusing LCM with GCD | LCM is the smallest common multiple (bigger), GCD is the largest common divisor (smaller) | Remember: LCM ≥ max(a, b); GCD ≤ min(a, b) |
| Forgetting the highest power | Using the lowest exponent gives GCD, not LCM | Always pick the maximum exponent per prime |
| Missing prime factors | Every distinct prime from any number must appear | Build the union of all prime factors with max exponents |
| Assuming LCM = a × b always | Only true when GCD(a, b) = 1 (coprime) | Use LCM(a, b) = a × b ÷ GCD(a, b) |
| Forgetting the zero case | Every multiple of 0 is 0, so no smallest exists | Reject 0 as input; LCM is undefined with 0 |
| Not simplifying fractions first | Unsorted fractions can give wrong results | Reduce each fraction before applying the LCM formula |
Quick answers to the most common LCM questions.
The LCM of two numbers is the smallest positive integer that both numbers can divide evenly. For example, LCM(6, 8) = 24 because 24 is the smallest number divisible by both 6 and 8.
You can find it in one of two ways: (1) prime factorize each number, take the highest power of every prime, and multiply; or (2) find LCM of the first two numbers, then find LCM of that result with the third. Both give the same answer.
LCD (Least Common Denominator) is just the LCM applied to the denominators of fractions. The math is identical — the name only changes because of context. LCM(4, 6) = 12 and LCD(1/4, 1/6) = 12.
The LCM is always greater than or equal to the largest number in the set. It can never be smaller than any input number. If the two numbers are equal, LCM(a, a) = a.
No. LCM is only defined for positive integers (and positive rationals) and is always positive. Some textbooks extend it to negative integers by taking the absolute value, but the result is always positive.
LCM involving 0 is undefined in standard arithmetic, because every multiple of 0 is 0, and there is no "smallest" positive multiple. Our calculator rejects inputs containing 0.
LCM is used for adding fractions, scheduling repeating events (buses, alarms), aligning gear rotations, planning purchases with different package sizes, music rhythm patterns, and many computer science algorithms like rate limiting and hash table sizing.
For any two positive integers a and b: LCM(a, b) × GCD(a, b) = a × b. This identity lets you calculate one if you know the other — it's the basis of the GCD method for finding LCM.
Yes. Convert each decimal to a fraction first (0.5 → 1/2, 1.25 → 5/4), then apply the LCM formula for fractions. Our calculator does this automatically in Decimal mode.
If both numbers are prime and different, their LCM is simply their product. For example, LCM(7, 11) = 77. If they're the same prime, LCM(p, p) = p.
Key terms you'll encounter while working with LCM.