What is the least common multiple?
A multiple of a positive integer is the result of multiplying it by a positive whole number. The multiples of 12 begin 12, 24, 36, 48, and 60, while the multiples of 18 begin 18, 36, 54, and 72. Numbers such as 36 and 72 that occur in both lists are common multiples. The smallest positive one is the least common multiple, abbreviated LCM.
An LCM calculator is useful when unlike fractions need a common denominator, repeating schedules must align, or equal package groups must be compared. The result is never chosen merely because it is divisible by one input. It must be divisible by every entered integer, and no smaller positive integer can meet all the same prime-factor requirements.
How to use the LCM calculator with steps
Enter two to eight positive integers separated by commas or spaces, such as 12, 18, 30. You may also type lcm(12, 18). Select Find LCM, then compare the interpreted integer list with your question before reading the factorization steps. The result panel reports the LCM and its companion GCD (also called GCF). Decimals, fractions, zero, and negative values are rejected because this tool follows positive-integer definitions.
- Read the entered positive integers in their original order.
- Write every integer as a product of prime powers.
- List every prime that appears in at least one factorization.
- For each prime, select the largest exponent found in any input.
- Multiply the selected prime powers to obtain the LCM.
- Divide the result by every original integer to verify whole-number quotients.
- Keep the smallest exponent of each prime shared by every input, then multiply those powers to obtain the GCD.
Worked example: find the LCM of 12, 18, and 30
Prime factorization gives 12 = 2^2 × 3, 18 = 2 × 3^2, and 30 = 2 × 3 × 5. The primes involved are 2, 3, and 5. The greatest exponent of 2 is 2, the greatest exponent of 3 is 2, and the greatest exponent of 5 is 1.
Using those maximum powers gives LCM = 2^2 × 3^2 × 5 = 4 × 9 × 5 = 180. The powers shared by all three numbers are 2 and 3, so GCD = 2 × 3 = 6. Exact checks give 180 ÷ 12 = 15, 180 ÷ 18 = 10, and 180 ÷ 30 = 6 for the LCM; they also give 12 ÷ 6 = 2, 18 ÷ 6 = 3, and 30 ÷ 6 = 5 for the GCD.
Listing multiples versus prime factorization
Listing multiples works well for small pairs. Write several multiples of each number and identify the first value appearing in every list. For 4 and 6, the lists 4, 8, 12 and 6, 12 show quickly that the LCM is 12. With three numbers or larger values, however, the lists grow and it becomes easier to overlook a smaller common multiple.
Prime factorization scales more clearly because it records exactly what divisibility requires. A professional least common multiple calculator can therefore show both the arithmetic result and the structural reason: each selected prime power is necessary to cover at least one input. This calculator uses that method consistently, including when one number already divides another.
Where LCM appears in fractions and schedules
When adding 1/12 and 1/18, the least common denominator is LCM(12, 18) = 36. Rewriting the fractions as 3/36 and 2/36 creates equal-sized pieces without using a denominator larger than necessary. This connection makes LCM one of the main foundations of exact fraction arithmetic.
LCM also answers alignment questions. If one event repeats every 12 minutes and another every 18 minutes, both cycles return together after 36 minutes, assuming they begin together. The same reasoning applies to package sizes, maintenance intervals, rotations, and repeating patterns. Always check that the real problem asks for the first shared occurrence rather than the greatest group size, which would require a GCF.
Common LCM mistakes and reliable verification
Do not confuse factors with multiples. A factor divides a number, while a multiple is produced by multiplying it. Another common error is multiplying all inputs immediately. Their product is certainly a common multiple, but repeated prime factors may make it much larger than the least common multiple. Selecting the greatest exponent of each prime removes that duplication.
To check an LCM answer, divide it by every input and require a whole-number quotient. To check the GCD, divide every input by the GCD and again require whole-number quotients. Then inspect the chosen prime powers: the LCM row must use the maximum exponents, while the GCD row can use only the minimum exponents shared by every number. The calculator records both kinds of evidence rather than relying on a guess from a list.