Enter an equation or problem
Camera input is not recognized!

Solution - Least common multiple (LCM) by prime factorization

6,720
6,720

Step-by-step explanation

1. Find the prime factors of 32

Tree view of the prime factors of 32: 2, 2, 2, 2 and 2

The prime factors of 32 are 2, 2, 2, 2 and 2.

2. Find the prime factors of 40

Tree view of the prime factors of 40: 2, 2, 2 and 5

The prime factors of 40 are 2, 2, 2 and 5.

3. Find the prime factors of 48

Tree view of the prime factors of 48: 2, 2, 2, 2 and 3

The prime factors of 48 are 2, 2, 2, 2 and 3.

4. Find the prime factors of 56

Tree view of the prime factors of 56: 2, 2, 2 and 7

The prime factors of 56 are 2, 2, 2 and 7.

5. Find the prime factors of 64

Tree view of the prime factors of 64: 2, 2, 2, 2, 2 and 2

The prime factors of 64 are 2, 2, 2, 2, 2 and 2.

6. Build a prime factors table

Determine the maximum number of times each prime factor (2, 3, 5, 7) occurs in the factorization of the given numbers:

Prime factorNumber32 40 48 56 64 Max. occurrence
2534366
3001001
5010001
7000101

The prime factors 3, 5 and 7 occur one time, while 2 occurs more than once.

7. Calculate the LCM

The least common multiple is the product of all factors in the greatest number of their occurrence.

LCM = 222222357

LCM = 26357

LCM = 6,720

The least common multiple of 32, 40, 48, 56 and 64 is 6,720.

Why learn this

The least common multiple (LCM), sometimes called the lowest common multiple or least common divisor, is helpful for understanding the relationships between numbers. For example, if it takes Earth 365 days to orbit the sun and it takes Venus 225 days to orbit the sun and both are in perfect alignment at the time this scenario is given, how long will it take for Earth and Venus to align again? We can use LCM to determine that the answer would be 16,425 days.

LCM is also a very important part of many mathematical concepts that also have real-world applications. For example, we use LCMs when adding and subtracting fractions, which we use quite frequently.