Source: Gmat Prep, mba.com, Test II
I am looking for the most efficient (fastest) way to solve this DS problem. Thanks!
Is |x| = y - z?
(1) x + y = z
(2) x < 0
christiancryan Wrote:My pathway is similar to Jeff's, though I tend to try to set up explicit cases immediately as I rephrase the question (keeping it as a question) BEFORE looking at the statements. This works better for me, so that I don't get confused by the statements.
Is |x| = y - z?
This is rephrasable to a "two-case" question:
a) If x >= 0, is x = y - z?
b) If x =< 0, is -x = y - z?
(This comes from simply substituting, for |x|, a two part condition: (a) x, if x >=0 (b) -x, if x <= 0. You can do this for ANY absolute value expression: as you "drop the absolute-value fences," set up two cases.)
Now
(1) x + y = z
Rephrase to match one of my questions -- turns out to be #2. But I don't know which case I'm in, so insufficient.
(2) x < 0
Obviously insufficient.
Together, I know the case from statement 2 and the answer to the question from statement 1.