DS Absolute Value OG 11 #105

[tonebeeze]

Is |x| = y - z?

1. x + y = z
2. x < 0

OA = C

[HSPA]

using 2: x<0 we have |x| as -x and
using 1: -x = y-z

=> |x| = y-z

[manpsingh87]

Is |x| = y - z?

1. x + y = z
2. x < 0

OA = C

please go through the following thread for detailed solution!!
https://www.beatthegmat.com/is-x-y-z-t20915.html

[ikaplan]

start with the easier statement- in this case, this is Statement 2. X<0- there is no information about y and z so Statement 2 is insufficient (discard B and D).

then move on to Statement 1 by testing numbers. since there is no information about x, y, z (integers, positive, negative etc.) plug in both positive and negative numbers.

test 1: x=1, y=2 ---> z=3; in this case we get 1=2-3 (=-1) NO
test 2: x=-1, y=-2 ---> z= -3; 1=-2+3 (=1) YES

since statement 2 gives different answers to the stem question (for some numbers YES, for some NO) we can conclude that this statement is insufficient.

Now combine both statement- if you go back to solutions in Statement 2 you will see that the equation works when x<0.

Therefore, the answer is C.

[lunarpower]

statement 1:
we can rephrase this to x = z - y.
there are thus 3 possibilities for the absolute value |x| :
(a) if z - y is positive, then |x| = z - y, and will NOT equal y - z (which is a negative quantity).
(b) if z - y is negative, then |x| = y - z (the opposite of z - y).
(c) if z - y = 0, then |x| equals both y - z and z - y, since each is equal to 0.
TAKEAWAY: when you consider absolute value equations, you'll often do well by considering the different CASES that result from different combinations of signs.
notice that (a) and (b), or (a) and (c), taken together prove that statement 1 is insufficient.

--

statement 2:
we don't know anything about y or z, so this statement is insufficient.**
if you must, find cases: say y = 2 and z = 1. if x = -1, then the answer is YES; if x is any negative number other than -1, then the answer is NO.

--

together:
if x < 0, then this is case (b) listed above under statement 1.
therefore, the answer to the prompt question is YES.
sufficient.

--

**note that, if i were particularly evil, i could craft a statement that doesn't mention all three of x, y, z and yet IS STILL SUFFICIENT.
here's one way i could do that:
(2) y < z
in this case, y - z is negative and therefore CAN'T equal |x| -- no matter what x is -- since |x| must be nonnegative.
so, this statement is a definitive NO, and is thus sufficient even though it doesn't mention x at all.
this is evil, but i see no reason why it wouldn't be on the test.