Live GMAT classes with Target Test Prep start Nov 21 and Nov 22. First class free.

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

Newsweek Readers’ Choice Awards 2026 winner: Target Test Prep, #1 Test Prep

Target Test Prep was voted #1 Best Test Prep in the 2026 Newsweek Readers’ Choice™ Awards.

★★★★★5.0563 reviews
GMATLiveTeachStarts Nov 22
Josh Braslow, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Josh Braslow, 20+ years in test prep

Nov 22 · Josh Braslow
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemandStart anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

EXECUTIVE ASSESSMENT

with

165+ EA score guarantee
$05-day trial no automatic billing
Schedule
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 Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget Test Prep
GMATOnDemandStart 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

Manhattan GMAT 700+ Challenge Problem - Absolute

Expert replies
by Kevin » Mon Jun 19, 2006 7:19 am
Here is another example of a 700+ Data Sufficiency problem. Try to solve it (I'll post the solution next Monday).

Absolutely Fabulous
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

(A) Statement (1) ALONE is sufficient to answer the question, but statement (2) alone is not.
(B) Statement (2) ALONE is sufficient to answer the question, but statement (1) alone is not.
(C) Statements (1) and (2) TAKEN TOGETHER are sufficient to answer the question, but NEITHER statement ALONE is sufficient.
(D) EACH statement ALONE is sufficient to answer the question.
(E) Statements (1) and (2) TAKEN TOGETHER are NOT sufficient to answer the question.
Kevin Fitzgerald
Director of Marketing and Student Relations
Manhattan GMAT
800-576-4626

Contributor to Beat The GMAT!
Join the discussion
Source: — Data Sufficiency |

by dkiran01 » Tue Jun 20, 2006 10:32 pm
is it D..not very sure.. :wink:
Join the discussion

by lan0583 » Wed Jun 21, 2006 4:49 am
the answer is E...

A is not sufficient because we need the value of K
B is not sufficient because we need the value of X

Combining A & B. Since the value of X is less than 0, X could be -1, -2, and so on..

Let's try -1 for x
y=lx-kl - lx+kl
y=l-1-3l - l-1+3l
y=l-4l - l2l
y= 2

Let's try -2 for x
y=lx-kl - lx+kl
y=l-2-3l - l-2+3l
y=l-5l - l1l
y= 4

We can see that the value of y varies. So the answer is E.
Join the discussion

by cjas » Wed Jun 21, 2006 7:39 am
E

y = mod(x-k) - mod(x+k)

3 cases

k>x
y = -2x
k<x
y = -2k
k=x
y = -2x


1) x<0
gives y>2*mod(x) and y < -2k

2) k = 3
y = -2k = -6
y= -2x (where -2x would be > -6)

in either case we do not know x
even upon considering 1)and 2) together, we do not know x

so E
Join the discussion

oops i didnt read it carefully

by aim-wsc » Thu Jun 22, 2006 12:09 am
quite tough
but answer is E
oops i didnt read it carefully earlier.:shock:
ok if its max it has to be B.
Last edited by aim-wsc on Sun Jun 25, 2006 1:38 pm, edited 2 times in total.
Join the discussion

i think its statement 2 only wat u say?

by dudeasc » Sat Jun 24, 2006 8:50 am
i think its statement 2 only wat u say?

wats the real answer?
hi
Join the discussion

by jbsears » Sun Jun 25, 2006 9:01 am
I'm getting B. The maximum seems to max out at 6. Let us know, quite curious. These types of q's are the most difficult for me.
Join the discussion

Answer

by Kevin » Tue Jun 27, 2006 7:16 am
Answer
(1) INSUFFICIENT: Statement (1) is insufficient because y is unbounded when both x and k can vary. Therefore y has no definite maximum.

To show that y is unbounded, let's calculate y for a special sequence of (x, k) pairs. The sequence starts at (-2, 1) and doubles both values to get the next (x, k) pair in the sequence.

y1 = | -2 – 1 | – | -2 + 1 | = 3 – 1 = 2
y2 = | -4 – 2 | – | -4 + 2 | = 6 – 2 = 4
y3 = | -8 – 4 | – | -8 + 4 | = –12 + 4 = 8
etc.

In this sequence y doubles each time so it has no definite maximum, so statement (1) is insufficient.

(2) SUFFICIENT: Statement (2) says that k = 3, so y = | x – 3 | – | x + 3 |. Therefore to maximize y we must maximize | x – 3 | while simultaneously trying to minimize | x + 3 |. This state holds for very large negative x. Let's try two different large negative values for x and see what happens:

If x = -100 then:
y = |-100 – 3| – |-100 + 3|
y = 103 – 97 = 6

If x = -101 then:
y = |-101 – 3| – |-101 + 3|
y = 104 – 98 = 6

We see that the two expressions increase at the same rate, so their difference remains the same. As x decreases from 0, y increases until it reaches 6 when x = –3. As x decreases further, y remains at 6 which is its maximum value.

The correct answer is B.
Kevin Fitzgerald
Director of Marketing and Student Relations
Manhattan GMAT
800-576-4626

Contributor to Beat The GMAT!
Join the discussion

by krisraam » Thu Jul 23, 2009 6:17 pm
On a number line the points will be like this

-------- -k --------0----------k----------

For y to have maximum value x needs to be either equal to or less than -k

y is max when x<=-k

y = 2k

We need k value to find the answer for y

B is sufficient.

Thanks
Raama
Join the discussion

by ketkoag » Fri Jul 24, 2009 3:16 am
nice one kevin!!
Join the discussion