BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
Vote for Target Test Prep, Newsweek Readers’ Choice Awards 2026
NEWSWEEK READERS’ CHOICE 2026

BIG NEWS! Target Test Prep has been nominated, and they’d love your vote!

TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

Vote for TTP
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

GMAT Prep - Absolute Values

Expert replies
by fleurdelisse » Wed Apr 22, 2009 4:27 am
Interesting problem - does anyone have an easier way to do it?

If zy < xy < 0, is |x-z| + |x| = |z|?
(1) z<x
(2) y>0

(1) Since z < x, then |x-z| = x-z
And since zy < xy < 0 and z < x, then x and z are negative (they must be of opposite sign of y since their product is less than zero, and knowing that z < x, then y must be positive)
so |x| = -x and |z| = -z
and the equality is therefore not correct x-z-x EQUAL to -z
So we can answer the question
SUFFICIENT

(2) y>0, then z and x must be negative for their product to be negative
And since zy < xy, than z < x (both negative) so their absolute values is their opposite.

In this case, we have: |x-z| = x-z, |x| = -x and |z| = -z
so, |x-z| + |x| = x-z-x EQUAL to -z
SUFFICIENT

So answer is D
Last edited by fleurdelisse on Wed Apr 22, 2009 8:58 am, edited 1 time in total.
Join the discussion
Source: — Data Sufficiency |

by rossmj » Wed Apr 22, 2009 8:18 am
Where is this question from? It seems that the stems are contradicting each other which is not possible in a GMAT question. I agree with your analysis of the question, but it is not a possible question.
Join the discussion

by fleurdelisse » Wed Apr 22, 2009 8:33 am
It's from GMAT Prep. What is contradictory in the question?
Join the discussion

by rossmj » Wed Apr 22, 2009 8:39 am
z>x and y>0 is not possible given the stem. z and x can't take on different values (positive in 1, negative in 2) within the same question. Are you sure you didn't write the question down wrong?
Join the discussion

by fleurdelisse » Wed Apr 22, 2009 8:54 am
You're right - it's z <x! I will edit it. Thanks for noting this.

But the idea is the same. Is there any other more straightforward way to solve this.
Join the discussion

by scoobydooby » Wed Apr 22, 2009 9:07 am
Join the discussion

by rossmj » Wed Apr 22, 2009 9:23 am
With that correction yes there is a quick way to solve this. As you can see x and z must be negative and so if we rearrange the equation to get

|x-z| = |z| - |x|

so with both x and z negative we get a positve z minus x on both sides.

-x--z=|z|- |x|

Note that this invalidates your explanation as the answer is yes |x-z| + |x| = |z|, and also that even without the correction your explanation to statement 2 was incorrect.

Hope this helps. For more help on ABS look for posts by Ian Stewart, he does a great job explaining ABS using a number line approach. It is usually very helpful, especially when you have integers and variables mixed with ABS, but on a problem like this the key is to break it down to something simple that will make the question easy.
Join the discussion

by schumi_gmat » Wed Apr 22, 2009 9:48 am
Hi,


I solved the question and found that 2 was sufficient.

We dont know the sign of y.
We know that -

i) y>0, z<0 and x<0; z<x
ii) y<0, z>0 and x>0;z>x


For (i) the ans is Yes
For (i) ans is No.

From stmt 1:
z<x is true only if y>0

Hence disregard (ii) and stmt 1 is Suff

Ans D
Join the discussion