LCM Calculator
Enter 2 to 10 positive integers (whole numbers ≥ 1). Use the Add/Remove buttons to change the count.
Enter Your Numbers
Add 2 or more positive integers above, choose your preferred method, and the LCM will appear here with step-by-step working.
How to Use the LCM Calculator
Enter Your Numbers
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.
Choose a Calculation Method
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.
Frequently Asked Questions
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.