LCM Calculator - Free Online Tool

Find the Least Common Multiple of 2 to 10 integers with step-by-step solutions

The Least Common Multiple (LCM) is the smallest positive integer that is divisible by two or more given numbers without leaving a remainder. For example, the LCM of 4 and 6 is 12, because 12 is the first number that both 4 and 6 divide into evenly. This fundamental concept appears across nearly every area of mathematics, from simplifying fractions and solving equations to scheduling repeating events in everyday life. When adding or subtracting fractions with different denominators, finding the Lowest Common Denominator (LCD) — which is simply the LCM of the denominators — is the essential first step. For example, to add 1/4 + 1/6, you need to find LCM(4, 6) = 12, then rewrite both fractions as twelfths. Without the LCM, fraction arithmetic becomes unnecessarily complicated. Beyond fractions, the LCM solves real-world scheduling problems. If Bus A passes every 12 minutes and Bus B passes every 18 minutes, and both depart at 8:00 AM, the LCM tells you exactly when both buses will next be at the stop at the same time: 8:00 AM + 36 minutes = 8:36 AM. The same principle applies to gear synchronization in mechanical engineering, repeating musical patterns in composition, and event scheduling in project management. This calculator supports three calculation methods so you can choose the approach that best matches your learning style or current needs. The Prime Factorization method breaks each number into its prime components and selects the highest exponent of each prime — it is the most educational approach and scales well to large numbers. The GCF Method uses the relationship LCM(a, b) = |a × b| / GCF(a, b) and is computationally efficient. The Listing Multiples method enumerates multiples of each number until the first common value appears — best for small numbers and beginner learners. For multiple numbers (3 or more), the LCM is computed iteratively by applying the two-number formula repeatedly: LCM(a, b, c) = LCM(LCM(a, b), c). This works because LCM is both commutative (LCM(a, b) = LCM(b, a)) and associative, so the order does not affect the final answer. This calculator also displays the Greatest Common Factor (GCF) alongside the LCM, since these two values are closely related. For any two numbers a and b: LCM(a, b) × GCF(a, b) = a × b. This verification relationship helps confirm that both values are correct and gives insight into the mathematical structure of the numbers. Understanding both LCM and GCF together is key to mastering number theory at any level. The prime factor composition chart shows each input number as a color-coded bar segmented by its prime factors. Brighter segments indicate which prime powers dominate the LCM, giving you a visual intuition for why the LCM takes the value it does. This is especially helpful when teaching or learning the prime factorization method.

Understanding LCM

What Is the Least Common Multiple?

The Least Common Multiple (LCM) of two or more integers is the smallest positive integer that is divisible by all of them with no remainder. It is also called the Lowest Common Multiple or Smallest Common Multiple. For example, LCM(3, 4) = 12 because 12 is divisible by both 3 and 4, and no smaller positive integer satisfies this condition. The LCM always exists for any set of positive integers and is always at least as large as the largest number in the set. If any number in the set is a multiple of all the others, the LCM equals that number — for instance, LCM(3, 6) = 6. When two numbers share no common factors (they are coprime), their LCM equals their product: LCM(5, 7) = 35.

How Is the LCM Calculated?

There are three main methods. The Prime Factorization method factors each number into primes, then for each unique prime takes the highest exponent seen across all numbers, and multiplies these together. For example, 12 = 2² × 3 and 18 = 2 × 3², so LCM = 2² × 3² = 36. The GCF Method uses the formula LCM(a, b) = |a × b| / GCF(a, b), where the GCF is found using the Euclidean algorithm. For more than two numbers, apply iteratively: LCM(a, b, c) = LCM(LCM(a, b), c). The Listing Multiples method lists the multiples of each number until the smallest shared multiple appears — simple but slow for large inputs.

Why Does the LCM Matter?

The LCM is essential in many practical situations. In arithmetic, it provides the Lowest Common Denominator needed when adding or subtracting fractions with unlike denominators. In scheduling, it determines when two or more periodic events will next coincide — for example, two machines with different cycle times, or buses on different frequencies. In music theory, the LCM of note durations determines when rhythmic patterns repeat. In engineering, gear ratio calculations use the LCM to determine full synchronization cycles. In computer science, memory alignment and timing calculations frequently require LCM. Understanding and computing LCMs efficiently is a foundational mathematical skill that appears throughout education and professional work.

Limitations and Edge Cases

This calculator handles positive integers from 1 to 10,000,000 with up to 10 numbers at a time. A few special cases are worth noting: LCM(a, 1) = a for any number a, since 1 divides everything. LCM involving 0 is defined as 0 in most conventions, though this calculator requires inputs of at least 1. For very large numbers (millions), the prime factorization may take a fraction of a second to compute, but results remain accurate using integer arithmetic. For decimal inputs, convert them to integers first by multiplying by a power of 10, compute the LCM, then divide by the same power of 10. The Listing Multiples method is limited to exactly two numbers and is not recommended for large values where the LCM may be much larger than the inputs.

LCM Formulas

LCM via GCF

LCM(a, b) = |a × b| / GCF(a, b)

The most efficient formula for two numbers. First find the GCF using the Euclidean algorithm, then divide the product of the numbers by the GCF.

Prime Factorization Method

LCM = product of all primes at their highest exponents

Factor each number into primes, then for each unique prime factor take the highest exponent seen across all numbers and multiply them together.

LCM of Multiple Numbers

LCM(a, b, c) = LCM(LCM(a, b), c)

For three or more numbers, apply the two-number LCM formula iteratively. The operation is associative and commutative, so the order does not matter.

LCM-GCF Identity

LCM(a, b) × GCF(a, b) = a × b

The product of the LCM and GCF of two numbers always equals the product of the numbers themselves. Useful for verification or finding one value from the other.

LCM Reference Tables

LCM of Common Number Pairs

Quick reference showing the LCM for frequently encountered number combinations.

Numbers	LCM	GCF	Product Check
2, 3	6	1	6 × 1 = 6 = 2 × 3
3, 4	12	1	12 × 1 = 12 = 3 × 4
4, 6	12	2	12 × 2 = 24 = 4 × 6
6, 8	24	2	24 × 2 = 48 = 6 × 8
8, 12	24	4	24 × 4 = 96 = 8 × 12
9, 12	36	3	36 × 3 = 108 = 9 × 12
10, 15	30	5	30 × 5 = 150 = 10 × 15
12, 18	36	6	36 × 6 = 216 = 12 × 18
15, 20	60	5	60 × 5 = 300 = 15 × 20
24, 36	72	12	72 × 12 = 864 = 24 × 36

Worked Examples

Find LCM of 12 and 18

Calculate the Least Common Multiple of 12 and 18 using the GCF method.

Find GCF(12, 18) using the Euclidean algorithm: 18 = 1×12 + 6, then 12 = 2×6 + 0 → GCF = 6

Apply the formula: LCM = |12 × 18| / GCF = 216 / 6 = 36

Verify: 36 ÷ 12 = 3 and 36 ÷ 18 = 2, both whole numbers

LCM(12, 18) = 36. This means 36 is the smallest number divisible by both 12 and 18.

LCM of 4, 6, and 15 Using Prime Factorization

Find LCM(4, 6, 15) by factoring each number into primes.

Factor each number: 4 = 2², 6 = 2 × 3, 15 = 3 × 5

List all unique primes: 2, 3, 5

Take the highest exponent of each: 2² (from 4), 3¹ (from 6 or 15), 5¹ (from 15)

Multiply: 2² × 3 × 5 = 4 × 3 × 5 = 60

LCM(4, 6, 15) = 60. Verification: 60/4 = 15, 60/6 = 10, 60/15 = 4 — all whole numbers.

Fraction Addition Using LCM as LCD

Add the fractions 1/8 + 1/12 by finding the Lowest Common Denominator.

Find LCM(8, 12): 8 = 2³, 12 = 2² × 3 → LCM = 2³ × 3 = 24

Rewrite fractions with denominator 24: 1/8 = 3/24, 1/12 = 2/24

Add: 3/24 + 2/24 = 5/24

1/8 + 1/12 = 5/24. The LCD of 24 is the LCM of the denominators 8 and 12.

How to Use the LCM Calculator

Inserisci i tuoi dati

Type a positive integer into each number field. The calculator starts with three fields (12, 18, 24 as defaults). Use the Add Number button to add up to 10 numbers, or the Remove button to reduce the count down to 2.

Scegli un Metodo di Calcolo

Select Prime Factorization to see each number broken into prime powers and take the highest exponent of each prime. Choose GCF Method for a fast algebraic approach using LCM = |a × b| / GCF. Choose Listing Multiples (for 2 numbers) to see the sequential multiples of both numbers until the first overlap.

Read the Results

The LCM appears as the main result. Below it you will find the GCF companion value, a verification equation (LCM × GCF = product of originals), a divisibility check confirming LCM divides evenly by all inputs, and the first 5 common multiples of the LCM.

Explore the Step-by-Step Workings

Click 'Step-by-Step Solution' to expand a detailed breakdown using your chosen method. Use the prime factor composition chart to see visually which prime powers each number contributes and which ones dominate the LCM. Export to CSV or print for school or work records.

Domande Frequenti

What is the LCM and how is it different from the GCF?

The LCM (Least Common Multiple) is the smallest number that all the given numbers can divide into evenly. The GCF (Greatest Common Factor) is the largest number that divides evenly into all the given numbers. For example, for 12 and 18: LCM = 36 (smallest shared multiple) and GCF = 6 (largest shared factor). The two are related by the formula LCM(a, b) × GCF(a, b) = a × b. The LCM is used when combining fractions (finding a common denominator), while the GCF is used when simplifying fractions. Both values reveal the underlying prime structure of the numbers.

Which calculation method should I use — prime factorization or the GCF method?

For numbers smaller than 100, any method works well and the Listing Multiples method is the most intuitive to understand visually. For larger numbers or numbers with many digits, the GCF Method (Euclidean algorithm) is the fastest because it does not require finding prime factors. The Prime Factorization method is the best choice for education because it reveals the mathematical structure clearly and works for any quantity of numbers. If you are working with 3 or more numbers, use either the GCF or Prime Factorization method since Listing Multiples only supports two inputs.

How do I find the LCM of fractions?

To find the LCM of two fractions p/q and r/s, use the formula: LCM(p/q, r/s) = LCM(p, r) / GCF(q, s). This is most commonly used to find the Lowest Common Denominator (LCD) when adding fractions. For example, to add 1/4 + 1/6, the LCD is LCM(4, 6) = 12. You would rewrite the fractions as 3/12 + 2/12 = 5/12. Simply enter the denominators into this calculator to find the LCD instantly. The result is the smallest denominator that works for all your fractions.

What real-world problems does the LCM solve?

The LCM has many practical applications. In scheduling, if one event repeats every 4 days and another every 6 days, LCM(4, 6) = 12 tells you they will next coincide on day 12. In manufacturing, machines with different cycle times synchronize at intervals given by the LCM of their cycle lengths. In music, the LCM of note durations determines when two rhythmic patterns align. In engineering, gear synchronization is calculated using LCM. In computing, memory page alignment uses LCM to find efficient storage boundaries. Essentially, whenever two or more periodic patterns must align, the LCM identifies when that alignment first occurs.

Can the LCM ever equal one of the input numbers?

Yes — the LCM equals the largest number in the set when that number is a multiple of all the others. For example, LCM(3, 6, 12) = 12, because 12 is divisible by both 3 and 6. This happens when one number 'contains' all the others as factors. More formally, if every other number in the set divides the largest number, the LCM equals the largest number. This is a quick mental check you can do before computing: if the largest number divided by each smaller number gives a whole number for all inputs, the LCM is the largest number.

Why does LCM × GCF equal the product of two numbers?

For any two positive integers a and b, the relationship LCM(a, b) × GCF(a, b) = a × b always holds. This comes from prime factorization theory: every prime that appears in either a or b contributes to both the LCM (via the maximum exponent) and the GCF (via the minimum exponent). The sum of the max and min exponents equals the total contribution from both numbers. Multiplying the LCM and GCF together effectively accounts for every prime factor of both numbers exactly twice — the same as a × b. Note this identity only holds directly for exactly two numbers; for three or more, the relationship is more complex and does not simplify as neatly.