Hi All,
While this DS question is layered, it's based on a series of Number Properties, so you can solve it with a conceptual approach or by TESTing VALUES (and looking for patterns).
We're told that A, B and C are NON-ZERO INTEGERS and that Z = B^C. We're asked if A^Z is negative. This is a YES/NO question.
Fact 1: (A)(B)(C) is an odd positive number.
This Fact ultimately means that we could have EITHER 0 negative numbers or 2 negative numbers AND that all 3 variables are ODD...
IF.....
A = 1
B = 1
C = 1
Z = 1^1 = 1
A^Z = 1^1 = 1 and the answer to the question is NO.
IF.....
A = -1
B = -1
C = 1
Z = 1^(-1) = 1
A^Z = (-1)^1 = -1 and the answer to the question is YES.
Fact 2: |B + C| < |B| + |C|
This Fact ultimately means that B and C MUST have different signs (one is positive and one is negative)
IF.....
A = 1
B = 1
C = -1
Z = 1^(-1) = 1
A^Z = 1^1 = 1 and the answer to the question is NO.
IF.....
A = -1
B = 1
C = -1
Z = 1^(-1) = 1
A^Z = (-1)^1 = -1 and the answer to the question is YES.
Fact 2 is INSUFFICIENT
Combined, we know....
ABC is a positive odd number
|B+C| < |B| + |C|
A, B and C include either 0 negatives or 2 negatives
A, B and C are all ODD
B and C are opposite signs
Since B and C are opposite signs, this means that we MUST have 2 negative numbers (B or C AND A) and 1 positive number (B or C).
A = NEGATIVE ODD
Z = B^C so we either have
B^C = (negative odd)^(positive odd) = NEGATIVE ODD
or
B^C = (positive odd)^(negative odd) = POSITIVE ODD
To boil it down to the essential elements, A^Z = (Negative)^(Odd). The result is ALWAYS NEGATIVE, so the answer to the question is ALWAYS YES.
Combined, SUFFICIENT
Final Answer:
GMAT assassins aren't born, they're made,
Rich