There are two cases in the main question stem
CASE 1
when x>0 implies is x=y-z?
CASE 2
When x<0 implies -x=y-z or is x+y=z
Now look at the two helps given (1) says x+y=z but it is not given if x<0 or not so INSUFFICIENT
(2) given x<o nothing about y and z so INSUFFICIENT
BOTH SUFFICIENT AS THEY SATISFY CASE2
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
Featured Course
Target Test Prep GMAT OnDemand
Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.
- 715+ score guarantee — highest in the industry (99th percentile)
- 52 chapters · 1,500+ lessons · 4,000+ practice questions
- 400 hours of video · 1,500+ instructor-led HD smartboard lessons
- 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
- 24/7 live support + weekly Zoom office hours with GMAT instructors
- TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
- 1,200+ flashcards + AI-powered study assistant & daily calendar
- OnDemand, LiveTeach & GMAT Bootcamp formats available
- Also: GRE, SAT Math & Executive Assessment courses
- MBA Admissions Consulting now available
- 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
- 200,000+ students served
- 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★
5.0
(559 reviews)
130-pt guarantee
$0 to start
then $127/mo
gmat prep - absolute x
Source: Beat The GMAT — Data Sufficiency |
IMO B
(1) x + y = z makes x = z - y, hence mod (x) = mod (z - y), which could be equal to y - z regardless what sign is x with, only if y > z. This is because an absolute value is non-negative; and since we know nothing about y and z, hence insufficient.
(2) reads x < 0, this means that z - y < 0; and this makes us believe that 'yes', mod (x) = y - z. So (2) alone is sufficient, hence B.
(1) x + y = z makes x = z - y, hence mod (x) = mod (z - y), which could be equal to y - z regardless what sign is x with, only if y > z. This is because an absolute value is non-negative; and since we know nothing about y and z, hence insufficient.
(2) reads x < 0, this means that z - y < 0; and this makes us believe that 'yes', mod (x) = y - z. So (2) alone is sufficient, hence B.
The mind is everything. What you think you become. -Lord Buddha
Sanjeev K Saxena
Quantitative Instructor
The Princeton Review - Manya Abroad
Lucknow-226001
www.manyagroup.com
Sanjeev K Saxena
Quantitative Instructor
The Princeton Review - Manya Abroad
Lucknow-226001
www.manyagroup.com
State 2 not given any info regarding y and zsanju09 wrote:IMO B
(1) x + y = z makes x = z - y, hence mod (x) = mod (z - y), which could be equal to y - z regardless what sign is x with, only if y > z. This is because an absolute value is non-negative; and since we know nothing about y and z, hence insufficient.
(2) reads x < 0, this means that z - y < 0; and this makes us believe that 'yes', mod (x) = y - z. So (2) alone is sufficient, hence B.
not sufficient
It should be C.
sanju09 wrote:IMO C
(1) x + y = z makes x = z - y, hence mod (x) = mod (z - y), which could be equal to y - z regardless what sign is x with, only if y > z. This is because an absolute value is non-negative; and since we know nothing about y and z, hence insufficient.
(2) reads x < 0, insufficient for the same reasons as given in (1).
(1) & (2) means that z - y < 0; and this makes us believe that 'yes', mod (x) = y - z, hence C.
The mind is everything. What you think you become. -Lord Buddha
Sanjeev K Saxena
Quantitative Instructor
The Princeton Review - Manya Abroad
Lucknow-226001
www.manyagroup.com
Sanjeev K Saxena
Quantitative Instructor
The Princeton Review - Manya Abroad
Lucknow-226001
www.manyagroup.com
