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.

GMATPrep DS - Difficult for me

Expert replies
Source: — Data Sufficiency |

by givemeanid » Sun Jul 15, 2007 1:23 pm
Is |x| = y - z

(1) x + y = z
Doesn't tell anything about whether y > z or y < z.
If x = -1, y = 3, z = 2. |-1| = 3 - 2. True.
If x = 1, y = 2, z = 3. |1| not equal to 2 - 3. False
NOT SUFFICIENT.

(2) x < 0
Doesn't say anything about y and z.
NOT SUFFICIENT.

Combining:
x = z - y and x < 0. This could mean z is -ve and y is -ve or z is +ve, y is +ve.
x = -3, y = -2, z = -5. |x| = 3 = -2 - (-5). True
x = -3, y = 4, z = 7. |x| = 3 not equal to 4 - 7.
NOT SUFFICIENT.

Answer is (E). What is OA?
So It Goes
Join the discussion

by jayhawk2001 » Sun Jul 15, 2007 1:41 pm
givemeanid wrote:
Combining:
x = -3, y = 4, z = 7. |x| = 3 not equal to 4 - 7.
givemeanid, we don't get x+y = z for the above case.

Close. give it another shot.
Join the discussion

by givemeanid » Sun Jul 15, 2007 1:58 pm
Damn carelessness. I need to be careful! Thanks Jay.
So It Goes
Join the discussion

by chatekar » Sun Jul 15, 2007 9:54 pm
givemeanid,

Thanks for the explanation.
I'm in office right now, once I get back to home, I will post the OA.

Thanks
Join the discussion

by highfive287 » Wed Jul 25, 2007 7:45 pm
Hi there,

the question is asking whether /x/ = y - z

(1) the equation above can be written as -x = y - z (I) or x = y-z (II). We

know from (II) that /x/ = y -z. We need to examine (I).

For (I), if you times (-1) to both sides of equation, (I) will become

x = -y + z. Hence, it can also be written as x + y = z, which will be as

same as the first assumption (x + y = z). Sufficient

(2) x < 0 . It is not sufficient to determine if /x/ = y - z

The answer is A
Join the discussion

by marvelxx35 » Mon Jul 30, 2007 6:05 am
1) x + y = z or x = z - y

multiply by -1 to get: -x = y - z

-x = y - z, therefore the statement can only be true when x is negative.
-(-x) = |x|, so when x is negative, it's true
-x != |x|, so when x is positive, it's false

2) x<0

Not enough information.

1 and 2 together tells us that since x<0, the above equation will satisfy the given problem b/c when x is negative, |x| = y - z.
Join the discussion

by bingojohn » Tue Aug 07, 2007 8:33 am
[quote="chatekar"]givemeanid,

Thanks for the explanation.
I'm in office right now, once I get back to home, I will post the OA.

Thanks[/quote]

The answer is [C], sufficient together but neither alone
Join the discussion

by lalitgmat » Tue Aug 07, 2007 5:35 pm
If you start from (B), x < 0 implies |x| = (-x), y & z does not come into picture. So we have to take stmt A.
from A alone we have x = -(y - z ).

Combining (A) and (B) x = (y -z )
and principle of modulus states, |x| = a implies -a <= x < a
in this case 'a' being ( y - z ).

Hence Both stmts are sufficient. However, first stmt deduction, x = (z -y) or -(y -z) holds true only when x < 0.

Hence option (C)...Nice question.
"We always take |x| as -x and +x , remeber here x can be -ve but |x| is always is +ve."
Join the discussion

by bingojohn » Wed Aug 08, 2007 4:54 am
Also, just wanted to point out to chatekar, correct usage of the word advice (vs advise).

Advice is an abstract noun, representing someone's advice to you.
Advise is a verb, the action of providing advice to someone.

Ignore this, in case that was just a mis-spell... (mis-spells like this one will kill you in AWA though).
Join the discussion

by chatekar » Wed Aug 08, 2007 5:05 am
Thanks bingojohn
Thats was pretty silly mistake
Join the discussion