Least Common Multiple Calculator

What is the Least Common Multiple (LCM)?

In mathematics, the least common multiple, also known as the lowest common multiple of two (or more) integers a and b, is the smallest positive integer that is divisible by both. It is commonly denoted as LCM(a, b).

Brute Force Method

There are multiple ways to find a least common multiple. The most basic is simply using a "brute force" method that lists out each integer's multiples.

As can be seen, this method can be fairly tedious, and is far from ideal.

Prime Factorization Method

A more systematic way to find the LCM of some given integers is to use prime factorization. Prime factorization involves breaking down each of the numbers being compared into its product of prime numbers. The LCM is then determined by multiplying the highest power of each prime number together. Note that computing the LCM this way, while more efficient than using the "brute force" method, is still limited to smaller numbers. Refer to the example below for clarification on how to use prime factorization to determine the LCM:

Greatest Common Divisor Method

A third viable method for finding the LCM of some given integers is using the greatest common divisor. This is also frequently referred to as the greatest common factor (GCF), among other names. Given LCM(a, b), the procedure for finding the LCM using GCF is to divide the product of the numbers a and b by their GCF, i.e. (a × b)/GCF(a,b). When trying to determine the LCM of more than two numbers, for example LCM(a, b, c), find the LCM of a and b where the result will be q. Then find the LCM of c and q. The result will be the LCM of all three numbers. Using the previous example:

Note that it is not important which LCM is calculated first as long as all the numbers are used, and the method is followed accurately. Depending on the particular situation, each method has its own merits, and the user can decide which method to pursue at their own discretion.

Frequently Asked Questions