maihuna wrote:Ian,
You provided fantastic soln but can you elaborate please with an algebraic solution?
I wouldn't normally do this kind of question algebraically, but it is certainly possible. We need to use the fact that |x| = x if x is positive, and |x| = -x if x is negative.
Since we're given that a < y < z < b, we can easily work out whether the expressions in each absolute value are positive or negative. Note also that since y < z, then 2y < 2z must be true.
-- In the question itself, we're asked if |y-a| < |y-b|. Since y - a is positive, |y - a| = y - a. Since y - b is negative, |y - b| = b - y. So the question is just asking if y - a < b - y, or if 2y < a + b.
-- Statement 1 tells us that |z - a| < |z - b|. As above, z - a is positive and z - b is negative, so this really tells us that z - a < b - z, or 2z < a + b. Well since 2y < 2z, then 2y < a + b must be true. Sufficient.
-- Statement 2 tells us that |y - a| < |z - b|. As above, y - a is positive and z - b is negative, so this really tells us that y - a < b - z, or y + z < a + b. Now, since y < z, y + y must be less than y + z, so 2y must be less than a + b. So this statement is also sufficient.
As I said above, however, I wouldn't personally consider taking this approach to this question.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com
ianstewartgmat.com