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

Is |x| = y - z ?

Expert replies

by rajeshsinghgmat » Mon Feb 25, 2013 10:54 pm
C the answer.
Join the discussion

by manasgoswami1 » Thu Aug 15, 2013 10:49 pm
hi,

i have a query here. if i consider condition 1 then i can say

y=z-x
substituting in question i get |x|=y-z=z-x-z

which is |x|= -x

which can never be the case as mod of any value is not negative.

so can't i infer that statement 1 is sufficient??
Join the discussion

by Java_85 » Fri Aug 16, 2013 3:25 pm
manasgoswami1 wrote:hi,

i have a query here. if i consider condition 1 then i can say

y=z-x
substituting in question i get |x|=y-z=z-x-z

which is |x|= -x

which can never be the case as mod of any value is not negative.

so can't i infer that statement 1 is sufficient??
No, You can't say that, simply put x=-1 then the statement is right, now put x=1 it's not right, therefore statement 1 is not enough.
Join the discussion

by manasgoswami1 » Sun Aug 18, 2013 8:44 pm
thanks:)
Join the discussion

by swathi8388 » Wed Aug 21, 2013 1:43 am
I felt this problem to be pretty simple.

question asks whether |x|=y-z? rephrasing it gives : -x=y-z ? or x=y-z ?

1. gives us x+y=z
=> x=z-y
=> -x=y-z

2. x<0 so it is negetive

both together gives us the information needed, i.e x is negetive , hence -x=y-z is true
Join the discussion

by jaspreetsra » Sun Nov 09, 2014 12:40 pm
Ans: C
Join the discussion

by deepak4mba » Fri Apr 06, 2018 12:48 am
Join the discussion