enigma123
If n is a positive integer and \(n^2\) is divisible by 96, then the largest positive integer that must divide n is
(A) 6
(B) 12
(C) 24
(D) 36
(E) 48
This is how I am trying to solve. The prime factorization of 96 is (\(2^5\))(3), so \(n^2\) must share those
prime factors.
Lets go straight into answer choices
A --> Is out as 6^6 = 36 is not divisible by 96
B --> 12 = \(2^2\) * 3. Not divisible by 96 because 12 has \(2^2\) * 3 as its prime factors. We need \(2^5\) or more.
C --> 24 . Prime factors are \(2^3\) * 3. Therefore \(n^2\) = {\(2^3\) * 3}\(^2\) = \(2^6\) * \(3^2\). OK its true.
D --> 36 . Prime factors are \(2^4\) * \(3^4\). We need \(2^5\) or more.
E --> 96. Prime factors are \(2^5\) * 3. So n ^2 is divisible by 96 and also by 48. So this can also be true??
Any thoughts guys?
Let me tell you why your method didn't work.
"The prime factorization of 96 is (\(2^5\))(3), so \(n^2\) must share those
prime factors."
You are right. n^2 must share those prime factors. But remember, it is a square so its prime factors have even powers. So n^2 must have 2^6*3^2. We know n^2 has one 3. It must have another 3 since it is a square. Similarly, we know n^2 has 2^5. It must have another 2 to make 2^6 so that the power of 2 is even.
n^2 = 2^6 * 3^2 (at least)
n = 2^3 * 3 = 24 (atleast)
Therefore, n is definitely divisible by 24 at least.
I have a question, why the question asking about the largest number which can divive n, but your answer is about the at leat number?