Question

What is the L.C.M of 5, 6 and 15?

Answer 1

Hint: Here we will use the prime factorization method to find the L.C.M. First we will write the given numbers as the product of their prime factors one – by – one. Now, if a prime factor will be repeating then we will write them in exponential form. Finally, we will take the product of all the different prime factors along with their highest exponent to get the answer.

Complete step by step solution:
Here we have been asked to find the L.C.M of the numbers: 5, 6 and 15. First, let us know about L.C.M.
In arithmetic and number theory, the least common multiple of two or more integers is the smallest positive integer that is divisible by each of the given. The given integers must not be 0. There are two methods to determine the L.C.M of two or more given numbers. Here, we will use the method of prime factorization.
In the method of prime factorization we write the given numbers as the product of their prime factors. Now, the L.C.M will be the product of the prime factors along with their highest exponent present.
Now let us come to the question. Here we have three numbers: 5, 6 and 15. Since 5 is already a prime number so it cannot be factored further but we can factor 6 and 15, so we get,
$$\begin{array}{rl}& \Rightarrow 5=5^1\\ & \Rightarrow 6=2^1\times 3^1\\ & \Rightarrow 15=3^1\times 5^1\end{array}$$
Clearly we can see that the highest power of the prime factors 2 is 1, 3 is 1 and 5 is 1. So, we need to multiply $2^1$, $3^1$ and $5^1$ to get the L.C.M.
$$\Rightarrow$$ L.C.M = $$2^1\times 3^1\times 5^1$$
$$\Rightarrow$$ L.C.M = $$2\times 3\times 5$$
$\therefore$ L.C.M = 30

Hence the L.C.M of 5, 6 and 15 is 30.

Note: There is one more method by which we can find the L.C.M. In that method we will write the multiples of 5, 6 and 15 one – by – one and check which multiple occurs first. But this method may not be preferred more because initially we don’t know how many multiples we need to write. In case the numbers provided are large then prime factorization is the best approach.