Prime factorization and the LCM
The least common multiple is the smallest positive integer divisible by every input. Prime factorization builds it by including every prime that appears in any input and using the highest exponent required. The result contains enough prime factors to reproduce each number as a divisor without unnecessary extras.
For 12=2²×3 and 18=2×3², use max(2,1)=2 for prime 2 and max(1,2)=2 for prime 3. Thus LCM=2²×3²=36. Using lower exponents would fail to include one input; using larger exponents would produce a common multiple but not the least one.
Least means no smaller positive common multiple exists. Listing multiples can demonstrate that fact for small inputs, but prime powers explain it directly: lowering any chosen maximum exponent makes at least one original number fail to divide the candidate. This minimality argument matters because multiplying all inputs always creates a common multiple, yet that product is often larger than necessary when the inputs share factors.
Factor each number completely
Use repeated division or factor trees until every leaf is prime. Write repeated primes with exponents and multiply them back as a check. Composite factors left unfinished can hide the exponent needed for the LCM.
Arrange prime powers in aligned columns or a table. Missing primes have exponent zero. For each row, select the maximum exponent across all inputs. This method extends directly from two numbers to three or more.
Prime factorization should be exact. For 72, writing 2³×9 leaves a composite factor; complete it as 2³×3². An incomplete table may miss the maximum exponent or treat a composite base as though it were independent from its prime components.
Process inputs one at a time and retain exact exponents. For several numbers, a table can use one column per input and one row per prime; blank cells mean exponent zero. The final column records each row maximum. This layout separates factorization errors from exponent-selection errors and remains readable when the same prime occurs with different powers across three or more values.
Three complete LCM examples
Input: 24 and 90. Formula: multiply all primes at their highest exponents. Calculation: 24=2³×3; 90=2×3²×5; maxima give 2³×3²×5=8×9×5=360. Result: LCM(24,90)=360. Interpretation: 360÷24=15 and 360÷90=4.
Input: 8, 12, and 15. Formula: select maximum exponents across all inputs. Calculation: 8=2³; 12=2²×3; 15=3×5; maxima give 2³×3×5=120. Result: LCM=120. Interpretation: every input divides 120, and removing any selected prime power breaks at least one divisibility requirement.
Input: 14 and 35. Formula: combine maximum prime powers. Calculation: 14=2×7 and 35=5×7; maxima give 2×5×7=70. Result: LCM=70. Interpretation: the shared 7 is included once, not multiplied twice.
Input: 18, 24, and 30. Formula: choose maximum exponents. Calculation: 18=2×3²; 24=2³×3; 30=2×3×5; maxima give 2³×3²×5=360. Result: LCM=360. Interpretation: quotients 20, 15, and 12 verify divisibility.
An ordered verification can make a long multiplication easier to audit. First compute each selected prime power, then multiply in stages, and finally divide the result by every original input. For 18, 24, and 30, calculate 2³=8 and 3²=9, then 8×9=72 and 72×5=360. Exact quotients 20, 15, and 12 establish common-multiple status; the exponent table establishes leastness.
Why the highest exponents are used
A multiple of 2³ must contain at least three factors of 2. If another input needs 2⁵, the common multiple must contain five. Selecting the maximum meets both requirements with no unnecessary sixth copy.
The GCF uses minimum exponents because it must fit inside every input. The LCM uses maximum exponents because every input must fit inside it. Keeping these opposite purposes in view is safer than memorizing “low” and “high” without meaning.
A common mistake is multiplying every displayed prime factor from every number. For 12 and 18, that produces 216 instead of 36 because shared requirements are duplicated. The LCM needs enough copies of each prime to cover the strongest requirement, not separate copies for every input. Maxima perform this union of requirements; they do not add the exponents.
Special cases and input boundaries
If one positive number divides another, the larger number is their LCM. For coprime positive integers, LCM equals their product. Under the common convention, LCM involving zero is zero because zero is a multiple of every integer, though some elementary tools restrict inputs to positive integers.
LCM is reported nonnegative. Factor absolute values if signed integers are allowed, and follow the tool’s documented range. The LCM can grow quickly and may exceed ordinary numeric limits in software even when each input is moderate.
When one number is a multiple of all others, it is already the LCM. For 4, 8, and 24, the result is 24. The prime table confirms this because 24=2³×3 already contains the prime powers required by 4=2² and 8=2³.
Inputs with repeated or redundant values can be simplified before factoring. Repeating 12 does not change LCM(12,18), and including 6 adds no new requirement because 6 already divides 12. Removing a value is safe only when another retained input is its multiple. This preprocessing reduces work but should be documented so readers can see why every original input remains covered by the final result.
Verification and the GCF relationship
Divide the proposed LCM by every input; each quotient must be an integer. To verify leastness from prime factors, confirm that reducing any selected exponent causes at least one input not to divide the candidate.
For two positive integers, GCF(a,b)×LCM(a,b)=a×b. This supplies a strong independent check. Compute (a÷GCF)×b to reduce overflow risk in software, then compare with the prime-factor result.
The product relationship is limited to two positive integers in its familiar form. Do not multiply three inputs and divide by a single multi-number GCF expecting the LCM. For multiple inputs, combine values iteratively—LCM(LCM(a,b),c)—or use the prime-exponent table across the whole set. Both valid methods should yield the same exact positive integer.
Using the LCM Calculator
Enter the supported positive integers. The LCM Calculator uses exact integer operations and can combine multiple values. It is useful for common denominators, repeating schedules, and divisibility checks when the underlying problem is genuinely about common multiples.
The tool does not determine whether a word problem calls for LCM rather than GCF, nor does it show a prime-factor proof. Label inputs and verify the modeling assumption before interpreting the result.
LCM applications include common denominators and idealized repeating cycles. Calendar schedules, machines, or events may have exceptions, offsets, downtime, or different starting points. Equal periods alone do not guarantee simultaneous occurrence unless their phase or starting condition is also aligned.
In fraction work, the LCM of denominators supplies the least common denominator, but numerators must then be multiplied by the matching scale factors. If denominators are 8 and 12, LCM=24; the first fraction's numerator is multiplied by 3 and the second by 2. Finding 24 alone does not complete an addition or comparison, and denominators must be nonzero.