Britannica Sources used in this answer

How can prime factorization be used to find a least common multiple?

Created from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles.

To find the least common multiple (LCM) of a set of integers using prime factorization, you first express each number as a product of its prime numbers raised to their respective powers.1

Once each number is factored, the LCM is calculated by identifying every distinct prime factor that appears in any of the numbers. For each of these primes, you select the highest exponent (the largest power) with which it occurs across all the factorizations. Multiplying these prime powers together yields the LCM.1

For example, given two numbers:
* a1=3,000=23×31×53
* a2=2,646=21×33×72

The LCM is found by taking the highest power of each prime present: 23, 33, 53, and 72. Multiplying these results in 23×33×53×72=1,323,000.1

This method relies on the fundamental theorem of arithmetic, which ensures that every composite number has a unique prime factorization.1