The least common multiple (LCM) of two or more positive integers is the smallest positive number they all share as a multiple. For example, , because is a multiple of both and nothing smaller works. This is the idea behind common denominators, repeating schedules, and any question about when two patterns line up again.
The formula and its key tool
The most compact rule connects the LCM to the greatest common divisor. For two positive integers and ,
The prime-factorization method is the other workhorse: write each number as a product of primes, then keep every prime that appears, using the largest exponent seen for each prime.
Keep one contrast straight throughout: a factor divides a number, while a multiple is produced by multiplying it. LCM is about multiples, not factors.
Why the methods work
The GCD formula holds because counts every shared prime power twice. Dividing by removes exactly the overlap, leaving the smallest number that still contains both.
The prime-power rule works for the same reason from the other direction. To be divisible by both numbers, a multiple must include each prime to at least the highest power either number demands. Taking the larger exponent supplies exactly that — no more, no less — which is why it produces the least common multiple rather than just any common multiple.
Worked example: the LCM of and
Use prime factorization:
Keep each prime with the larger exponent:
- For , the larger exponent is
- For , the larger exponent is
So:
Check directly:
Both divide evenly, so is a common multiple, and the prime-power construction guarantees it is the least one.
This shows up constantly in fraction addition. The denominators in have LCM , so
You also use LCM when two repeating events occur every and units and you want the first time they coincide.
Practice with two checks
Find the LCM of and two ways: by listing multiples and by prime factorization. Both routes should give . After you land on an answer, run two checks — is it divisible by each original number, and is there any smaller positive common multiple? For the prime-power method, the second check is baked into the method itself.
Common pitfalls
- Mixing up LCM and GCD. Smallest shared multiple means LCM; greatest shared factor means GCD.
- Stopping at a common multiple that is not the least. For and , both and are common multiples, but only is the LCM.
- Applying the "larger exponent" rule without factoring first. That rule only makes sense once the numbers are written as prime factorizations of positive integers.
Frequently Asked Questions
- What is the least common multiple?
- The least common multiple, or LCM, is the smallest positive number that two or more positive integers share as a multiple. For example, the LCM of 6 and 8 is 24, because 24 appears in both lists of multiples and no smaller positive number does. It is the idea behind common denominators and repeating schedules.
- How do you find the LCM using prime factorization?
- Write each number as a product of primes, then keep every prime that appears, using the largest exponent for each. For 12 and 18, the factorizations are 2 squared times 3 and 2 times 3 squared, so the LCM keeps two factors of 2 and two factors of 3, giving 36. This method is often clearest for larger integers.
- What is the relationship between LCM and GCD?
- For two positive integers a and b, the LCM equals their product divided by their greatest common divisor. This shortcut is efficient when you already know the GCD. The condition matters: the formula is used for positive integers, so check that before applying it instead of listing multiples or factoring.
- What is the difference between a factor and a multiple?
- A factor divides a number evenly, while a multiple is produced by multiplying a number by a positive integer. The LCM is about multiples, not factors: you are looking for the smallest number both inputs can reach by multiplication, not the largest number that divides them. Mixing these up is a common source of errors.
Need help with a problem?
Upload your question and get a verified, step-by-step solution in seconds.
Open GPAI Solver →