Least Common Multiple (LCM) Calculator
Enter two or more integers separated by commas to find their Least Common Multiple (LCM).
How to Find the LCM
Method: Prime Factorization
- Find the prime factorization of each number.
- Take each prime factor at its highest power.
- Multiply them together.
Example: LCM(4, 6)
- 4 = 22
- 6 = 2 × 3
- LCM = 22 × 3 = 12
LCM Formula
LCM(a, b) = |a × b| / GCF(a, b)
Related Calculators
When to Use the LCM Calculator
The least common multiple is essential whenever you need a shared time interval or a common denominator. Adding fractions like 1/4 + 1/6 requires finding LCM(4, 6) = 12, so both fractions become twelfths. In scheduling, if Task A repeats every 4 days and Task B every 6 days, LCM(4, 6) = 12 tells you they next coincide in 12 days. In music, LCM determines when rhythmic patterns of different lengths sync up again.
Key applications include: adding unlike fractions, synchronising repeating events, gear ratio engineering, LCD screen refresh timing, and modular arithmetic in computer science.
LCM Quick Reference
For two numbers, the fastest formula is LCM(a, b) = (a Ć b) / GCF(a, b). This avoids full prime factorisation and is what computers use internally.
| Numbers | LCM | Application |
|---|---|---|
| 4, 6 | 12 | Add 1/4 + 1/6 |
| 3, 4, 5 | 60 | Sync 3 recurring events |
| 12, 15 | 60 | Common denominator for 1/12 + 1/15 |
| 7, 11 | 77 | Two coprime numbers ā LCM = aĆb |
Methods for Finding the Least Common Multiple
The least common multiple (LCM) of two or more integers is the smallest positive integer that is evenly divisible by each of them. There are two main manual methods for finding it. The first is the listing method: list multiples of each number in order until you find the first value that appears in all lists. For small numbers this is quick, but it can be tedious for large values. The second and more powerful method uses prime factorization. Factor each number into primes, then for each distinct prime take the highest power that appears in any factorization, and multiply these together. For example, LCM(12, 18): 12 factors to 2 squared times 3; 18 factors to 2 times 3 squared. The LCM takes the highest power of each prime: 2 squared times 3 squared equals 4 times 9 equals 36. A third method uses the relationship between LCM and GCF: LCM(a, b) equals a times b divided by GCF(a, b). This formula is especially efficient when GCF can be found quickly via the Euclidean algorithm. The LCM is essential whenever you need a common denominator for adding or subtracting fractions with different denominators, and it appears in scheduling problems where events repeat at different intervals and you need to find when they next coincide.
LCM Reference Table
| Numbers | LCM | Method check |
|---|---|---|
| 4, 6 | 12 | 4×3 = 12; 6×2 = 12 |
| 5, 7 | 35 | Coprime: 5×7 = 35 |
| 12, 18 | 36 | 12×18 ÷ GCF(6) = 36 |
| 8, 12 | 24 | 2³ × 3 = 24 |
| 9, 15 | 45 | 3² × 5 = 45 |
| 6, 10, 15 | 30 | 2 × 3 × 5 = 30 |
LCM in Everyday Scheduling Problems
The LCM solves recurring coincidence problems naturally. If bus A arrives every 12 minutes and bus B arrives every 18 minutes and both depart together at noon, they will next depart simultaneously at the LCM of 12 and 18, which is 36 minutes later. The same logic applies to maintenance schedules (when two machines due for service at different intervals are next serviced together), music theory (when two rhythmic patterns of different lengths next align), and number theory proofs. Recognizing the LCM as a scheduling tool clarifies why it matters beyond classroom fraction problems.
