What is the smallest positive integer that is divisible by both and ?
- A
- B
- C
- D
Solution & Step-by-step Explanation
To find the smallest positive integer divisible by both and , we need to find their Least Common Multiple (LCM).
Let's use prime factorization:
Taking the highest power of each prime factor involved:
* Highest power of is
* Highest power of is
Therefore, the smallest positive integer divisible by both numbers is .
Let's use prime factorization:
Taking the highest power of each prime factor involved:
* Highest power of is
* Highest power of is
Therefore, the smallest positive integer divisible by both numbers is .