Bunuel wrote:
enigma123 wrote:
If n^2/n yields an integer greater than 0, is n divisible by 30?
(1) n^2 is divisible by 20
(2) n^3 is divisible by 12
For me its B. Can someone please confirm?
If n^2/n yields an integer greater than 0, is n divisible by 30?Given: n^2/n yields
an integer greater than 0 --> n>0 --> n^2/n=n=integer. So, the question basically asks whether n is a multiple of 30.
(1) n^2 is divisible by 20 --> 20=2^2*5 --> n is divisible by at least 2 and 5, otherwise these factors could not appear in n^2 (exponentiation does not "produce" primes), though we don't know about other possible factors of n. Not sufficient.
(2) n^3 is divisible by 12 --> 12=2^2*3 --> the same way here: n is divisible by at least 2 and 3, though we don't know about other possible factors of n. Not sufficient.
(1)+(2) n is divisible by 2, 3 and 5 hence by 2*3*5=30. Sufficient.
Answer: C.
Hi
BunuelGoing by the above theory ( exponentiation does not "produce" primes ) i approached a question on one of GMAT Club flash cards -:
Is integer x^2*y^4 divisible by 9?
1) x is an integer divisible by 3
2) xy is an integer divisible by 9
Its answer is E.
But i think B(Statement 2) is sufficient. exponentiation does not "produce" primes
What am i missing here?