HomeTestsSearchRankProfile
mediumMCQCompetitive Exam2026Quantitative Aptitude
3 attempts0% success rate1 mark

Find the smallest number which will be completely divisible by and .

  1. A
  2. B
  3. C
  4. D

Solution & Step-by-step Explanation

To find the smallest positive non-zero number completely divisible by and , we need to find their Least Common Multiple (LCM).
Let's find the prime factorization of each number:







To find the LCM, we take the highest power of each prime factor present in these factorizations:

* Highest power of is
* Highest power of is
* Highest power of is







Therefore, the smallest positive number divisible by all three numbers is .

Practice this question

Try it yourself before checking the explanation above.

Find the smallest number which will be completely divisible by and .
A
B
C
D

Share This Question

Related Questions

Ready for a Full Test?

Practice with timed mock tests and track your performance across Quantitative Aptitude.

Discussion