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.

Maximum value of y

Expert replies
Source: — Data Sufficiency |

by mals24 » Sat Apr 25, 2009 5:23 am
Try to use Ian's number line method (or distance method) to solve absolute value questions. It'll be much simpler.

Y = lX-Kl + lX+Kl

In general, lA-Bl = distance between A and B.

lX-Kl = distance between X and K

lX+Kl = distance between X and -K. You write this as lX-(-K)l

So basically X is in between K and -K. Draw a number line with -K and K as end points and place X in between them.

-K-------X---------------K

Y is simply the sum of distances between X to -k and X to K or in other words Y = 2K. So we need to know only the value of K to find out value of Y.

St 1: Insuff
St 2: K= 3 Suff.

Answer is B.

Also check out Ians solution in the following post. Its a different question but the concept is the same.
https://www.beatthegmat.com/absolute-val ... 19267.html
Join the discussion

by cubicle_bound_misfit » Sat Apr 25, 2009 6:26 am
I don't get the solution

y = |x-k| - |x+k|

the minus means it is the difference between this two distances
like say if k, x all positive and k> x

as shown by your example

-k---------------x--------------k

-------|x+k|--- --- |x-k|---

the question is saying it is the substarction between this two distances not sum, then how can be y= 2k.
and there are other cases to conside like x<0, k<0 x>k etc.

Ian,please help.
Cubicle Bound Misfit
Join the discussion

by cubicle_bound_misfit » Sat Apr 25, 2009 6:35 am
The way I would approach


|x-k| | |x+k| | y

+ + ( -2k )

+ - ( 2x )

- + ( -2x )
- - ( 2k )


This is where I am stuck to come to a decision.
Cubicle Bound Misfit
Join the discussion

by mals24 » Sat Apr 25, 2009 7:01 am
cubicle_bound_misfit wrote:The way I would approach


|x-k| | |x+k| | y

+ + ( -2k )

+ - ( 2x )

- + ( -2x )
- - ( 2k )


This is where I am stuck to come to a decision.
Shoot I copied the question incorrectly. I took addition instead of subtraction. Sorry for that.

I tried it again and my solution looks similar to yours. I'm getting E as the final answer (maximum value could be -2x or 2k). But I have a feeling Im missing something.
Join the discussion

by cramya » Sat Apr 25, 2009 7:13 am
I tried it again and my solution looks similar to yours. I'm getting E as the final answer (maximum value could be -2x or 2k). But I have a feeling Im missing something

Mals,
Can u help me understand the 2x part? I feel that the y can be
-2k if x is positive and 2k if x is negative.

Since k is positive 2k will be bigger than -2k.I feel irrepective of x being positive and less than k , x>k or, x being negative and less than k "2k" will be the maximum value for y.

So we can find the maximum value irrespective of the various cases for x.

Hence B

I may be missing something also. Nice problem.



Regards,
CR
Join the discussion

Re: Maximum value of y

by Ian Stewart » Sat Apr 25, 2009 7:22 am
Vemuri wrote:If k is a positive constant and y = |x - k| - |x + k|, what is the maximum value of y?
(1) x < 0
(2) k = 3

OA is B
I think mals might have thought there was a + sign, rather than a - sign, in the expression in the question (there are a few questions in official materials which are similar to the above, except with a plus sign instead of a minus between the two absolute value terms).

I don't much care for the wording of the question; it doesn't really make logical sense as a DS question, even if I can tell what the intention is of the question designer. After all, what kind of information would be sufficient to find the 'maximum value of y' in general? If you saw a question that asked 'what is the maximum value of y?' and one Statement read "y > 0", would that be sufficient, or insufficient? That's unclear.

In any case, looking at the expression in the question:

y = |x - k| - |x + k|

y = |x - k| - |x - (-k)|

then y is just the difference between the distance from x to k, and the distance from x to -k. Drawing the number line:

---------(-k)-----------------k----------------

let's consider the three 'zones' in which x might lie (to the right of k, between k and -k, or less than -k).

If x is greater than k, we have:

---------(-k)-----------------k-----------x-----

So y will be negative if x is to the right of k, since then the distance from x to k is less than the distance to -k.

If x is between -k and k, we have:

---------(-k)---x-------------k----------------

Notice then that the distance from x to k is less than the distance from -k to k, so is less than 2k. So y must be less than 2k in this case.

On the other hand, if x is less than -k, we have

-x--------(-k)----------------k----------------

Then, if we subtract the distance from x to -k from the distance from x to k, we're left with the distance from -k to k, which will always be 2k no matter what the value of x. That's certain to be larger than the values of y we found in the other two cases above.

So we have the largest value of y when x < -k, and the largest value is 2k. So if k=3, y will never be larger than 6. So for that reason, I imagine the question designer intends the answer to be B, though as I said above, I don't think the format makes logical sense. I'm curious about the source.
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
Join the discussion

by mals24 » Sat Apr 25, 2009 7:56 am
Thank you sooo much Ian for explaining the solution so systematically.

Cramya,

I made an error in my solution, just figured it out after looking at Ian's solution. You will not get 2x or -2x in your solution. Like you mentioned your possible solutions will be 2k and -2k and hence 2k gives you maximum value for y.
Join the discussion

Re: Maximum value of y

by Vemuri » Sat Apr 25, 2009 8:30 am
Join the discussion

by cubicle_bound_misfit » Sat Apr 25, 2009 9:07 am
Ian,

to put a modified U2 song "Clarity has a scent and it is like Ian Stewart's genius brain."
Cubicle Bound Misfit
Join the discussion

by ketkoag » Sat Apr 25, 2009 11:59 am
Ian could u please let us know about the authenticity of the source used here for this problem!! :? nice question though!!
Join the discussion