chaitanya.bhansali wrote:
Is x divisible by 12?
1) x is divisible by 27.
2) x is divisible by 6.
A lot of integer property questions can be solved using prime factorization.
For questions involving divisibility, divisors, factors and multiples, we can say:
If N is divisible by k, then k is "hiding" within the prime factorization of N
Consider these examples:
24 is divisible by
3 because 24 = (2)(2)(2)
(3)
Likewise, 70 is divisible by
5 because 70 = (2)
(5)(7)
And 112 is divisible by
8 because 112 = (2)
(2)(2)(2)(7)
And 630 is divisible by
15 because 630 = (2)(3)
(3)(5)(7)
Now onto the question.....
Target question: Is x divisible by 12?
Since 12 = (2)(2)(3), we can REPHRASE the target question as....
REPHRASED target question: Are there two 2's and one 3 hiding within the prime factorization of x?
Statement 1: x is divisible by 27
27 = (3)(3)(3), so we know that there are three 3's hiding within the prime factorization of x. So, we have the one 3 taken care of but can we be also certain that there are two 2's hiding within the prime factorization of x? NO
So, statement 1 is NOT SUFFICIENT
Statement 1: x is divisible by 6
6 = (2)(3), so we know that there is one 2 and one 3 hiding within the prime factorization of x. So, we have the one 3 taken care of but can we be also certain that there are two 2's hiding within the prime factorization of x? NO
So, statement 2 is NOT SUFFICIENT
Statements 1 and 2 combined
Statement 1 tells us that there are three 3's hiding within the prime factorization of x
Statement 2 tells us that there is one 2 and one 3 hiding within the prime factorization of x
Combined, we can be certain that there are three 3's AND one 2 hiding within the prime factorization of x.
So, we still have NOT guaranteed that
there is one 3 AND two 2's hiding within the prime factorization of x.
Since we cannot be certain that answer the
target question with certainty, the combined statements are NOT SUFFICIENT
Answer =
E
Cheers,
Brent