BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
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
Absolute values
Source: Beat The GMAT — Data Sufficiency |
IMO B
lxl=lyl?
1) x-y=6
x=3 y=-3 yes condition satifies 1 and the answer is yes but
if x=9 y=3 No hence insuffient
2)x+y=0
x=-y
so Yes Suffienct
lxl=lyl?
1) x-y=6
x=3 y=-3 yes condition satifies 1 and the answer is yes but
if x=9 y=3 No hence insuffient
2)x+y=0
x=-y
so Yes Suffienct
I think it diff way and i just want to know whether my way is correct or not. I think for proving mod x = mod y
we need to prove, if we take out mode... x = y ( if both are > 0) and -x = -y ( if <0)
coz by def of mode , mod x = x if x >0
mod x = -x if x<0
So, do we need to prove both condition in the ques below..or not.
Going by my method.
1.x-y =6
....>>> Not Suff
2. x+y=0, x=-y
utting back...mod(-y) = mod(y ) ....
... y = y ( If Y >00
-y = y( if y<0 )...not true. ....so B Insuff
taking together
x-y=6
x+y=0
x =3,y =-3
Here again comes my ques.
Do we have to put values and consider mode by >0 and <0
Pls f any1 can explain
we need to prove, if we take out mode... x = y ( if both are > 0) and -x = -y ( if <0)
coz by def of mode , mod x = x if x >0
mod x = -x if x<0
So, do we need to prove both condition in the ques below..or not.
Going by my method.
1.x-y =6
....>>> Not Suff
2. x+y=0, x=-y
utting back...mod(-y) = mod(y ) ....
... y = y ( If Y >00
-y = y( if y<0 )...not true. ....so B Insuff
taking together
x-y=6
x+y=0
x =3,y =-3
Here again comes my ques.
Do we have to put values and consider mode by >0 and <0
Pls f any1 can explain
vivek, I don't really follow your logic, but if:
|x| = |y|
then either x = y, or x = -y.
|x| is just the distance between 0 and x on the number line. If |x| = |y|, then x and y are both the same distance from zero. They're either both on the same side of zero, in which case they're equal, or they're on opposite sides of zero, in which case one is the negative of the other.
|x| = |y|
then either x = y, or x = -y.
|x| is just the distance between 0 and x on the number line. If |x| = |y|, then x and y are both the same distance from zero. They're either both on the same side of zero, in which case they're equal, or they're on opposite sides of zero, in which case one is the negative of the other.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com
ianstewartgmat.com
ianstewartgmat.com
No, not quite. If |x| = |y|, there are four possibilities (you do not seem to be considering the last two below):vivek.kapoor83 wrote:but i just wanted to know..do we need to prove both the equations.
x, y both positive --> x = y
x, y both negative --> x = y
x positive, y negative --> x = -y
x negative, y positive --> x = -y
Which is why I said above that |x| = |y| is true if x = y or x = -y. Note that -x = -y is exactly the same equation as x=y (just multiply both sides by -1), so there is no need to consider it separately.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com
ianstewartgmat.com
ianstewartgmat.com
















