Live GMAT classes with Target Test Prep start Nov 21 and Nov 22. First class free.

See classes
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.

Newsweek Readers’ Choice Awards 2026 winner: Target Test Prep, #1 Test Prep

Target Test Prep was voted #1 Best Test Prep in the 2026 Newsweek Readers’ Choice™ Awards.

★★★★★5.0563 reviews
GMATLiveTeachStarts Nov 22
Josh Braslow, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Josh Braslow, 20+ years in test prep

Nov 22 · Josh Braslow
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemandStart anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

EXECUTIVE ASSESSMENT

with

165+ EA score guarantee
$05-day trial no automatic billing
Schedule
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 Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget Test Prep
GMATOnDemandStart 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

ds4

Expert replies
by stubbornp » Sat Oct 04, 2008 12:19 pm
ds4
You do not have the required permissions to view the files attached to this post.
Join the discussion
Source: — Data Sufficiency |

by Morgoth » Sun Oct 05, 2008 12:14 am
IMO C

We just have to find out if x and z both are positive or both are negative and is x> z

Statement (1)
z < x
z and x both could be positive and both could be negative. We dont know anything about y. Insufficient.

Statement (2)
y>0
x and z both are negative but we dont know if x>z or x<z. Insufficient.

Combining (1) & (2)

x and z both are negative, x>z. Sufficient.

Thus, C
OA?
Join the discussion

by 4meonly » Sun Oct 05, 2008 1:03 am
I got A...
I am not sure, but i'll post. may be someone will find a flaw


Main: zy<xy<0

(1)
z<x, so to make zy<xy<0 right y should be positive
because if y will be negative and we will get zy>xy>0
z and x are negative
let z=-5, x=-3
|x-z|+|x|=|-3+5|+|-3|=5
|z|=|-5|=5
SUFF

(2)
y<0
yeah, I know it from (1) but what about z and y?
Insuff

A
You do not have the required permissions to view the files attached to this post.
Last edited by 4meonly on Sun Oct 05, 2008 1:29 am, edited 1 time in total.
Join the discussion

by Morgoth » Sun Oct 05, 2008 1:22 am
4meonly wrote: Main: zy<xy<0

(1)
z<x, so to make zy<xy<0 right y should be positive
because if y will be negative and we will get zy>xy>0
z and x are negative
let z=-5, x=-3
|x-z|+|x|=|-3+5|+|-3|=5
|z|=|-5|=5
SUFF

You cant assume that y is positive,

what if y is negative, z and x are positive.

z<x
let x = 4
z = 2
|x-z|+|x|= lzl

l4-2l + l4l = l2l
2+4 is not equal to 2


Therefore, statement I is insufficient, because y could be positive as well as negative. We just know x>z.

Hope its clear. Let me know if you still have any doubts.
Join the discussion

by 4meonly » Mon Oct 06, 2008 1:09 am
Morgoth wrote: You cant assume that y is positive,

what if y is negative, z and x are positive.
z<x
let x = 4
z = 2
|x-z|+|x|= lzl
l4-2l + l4l = l2l
2+4 is not equal to 2
Therefore, statement I is insufficient, because y could be positive as well as negative. We just know x>z.
Hope its clear. Let me know if you still have any doubts.
But this will not satisfy main statement - zy<xy<0 if y<0

will be xy<zy but we have zy<xy<0, threfore y<0 from the 1st stem


What is OA?
Join the discussion

by Morgoth » Mon Oct 06, 2008 5:56 am
I made the most terrible mistake again.

I apologize to you "4meonly" I tried to reason with you, presented you with counter argument when it was in fact wrong and you were absolutely correct in your reasoning.

Here is the answer which I think should be correct.

Statement (1)
z<x
if zy < xy <0 , y has to be positive.

Therefore x and z are negative. all the negative numbers satisfy the above equation. Sufficient.

Statement (2)
y>0

if y is greater than 0, then z and x are negative, all negative numbers satisfy the above equation. Sufficient.

Thus, D.


I think this should be the answer. Let me know if anybody thinks otherwise.

Thanks "4meonly" for bringing this question, it has really helped me clear some doubts of my own.

OA?
Join the discussion

by 4meonly » Mon Oct 06, 2008 6:52 am
Morgoth,
no problem. Your posts are helpful for me, too :D

I agree with you that answer should be D :lol: :idea:
Join the discussion

by 4meonly » Tue Nov 25, 2008 9:12 am
Can anybody confirm that answer is D?
Join the discussion

by srisl11 » Tue Nov 25, 2008 11:18 pm
Join the discussion

by logitech » Tue Nov 25, 2008 11:24 pm
zy < xy < 0

means that zy and xy have both two numbers with different signs. ( +-) or (-+)

and you will see that they both have "y" in common

SO:

A ) If Y>0 (X and Z) < 0 and X > Z so that we can have zy < xy < 0

B ) if Y<0 (X and Z) > 0 and X < Z so that we can have zy < xy < 0

Lets go back to statements:

1 ) z < x

This means that x - z > 0 so it can get out the absolute value sign as it is

and we also know that if x > Z they have to be both NEGATIVE NUMBERS ( look at A )

so:


IS |x - z| + |x| = |z| ?

X-Z + ( -X ) = -Z

which is |z|, since Z is negative it needs to be -Z

Sufficient :D

(2) y > 0

We already discussed this

A ) If Y>0 (X and Z) < 0 and X > Z so that we can have zy < xy < 0

Sufficient :D

Hence, it is D
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
Join the discussion