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
GMATBootcamp Starts Sep 28
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE BOOTCAMP

Live Online Bootcamp Class with Top GMAT Expert Chris Peckover

15 live classes from Sep 28, 2026

Schedule
Mon to Fri · 7:00 to 10:00 PM ET
Included
Live classes + 6 months of TTP OnDemand
  • Boost your GMAT score in less than one month in a live online class
  • 6 months access to TTP OnDemand video courses included
View bootcamp & 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.

GMAT Prep DS Numberline

Expert replies
Source: — Data Sufficiency |

by chatekar » Thu Jul 19, 2007 10:58 pm
M and R might lie anywhere on the number line.

From [1]

M = 1, R =3
M -1, R = -3
M = 2, R = 6

So we have multiple answers and hence [1] is not sufficient

From [2]

M = 5, R =17
M = 6, R = 18
M = 7, R = 19

So again we have multiple answers and [2] is not sufficient.

Combining [1] and [2],

M = 6 and R = 18 is the only answer

So [1] and [2] together are sufficient.

Whats the OA?

Thanks
Join the discussion

by erdnah » Thu Jul 19, 2007 11:16 pm
Ich think (1) and (2) are still not sufficient, in addition to chatekar's answer there's M = -12, R = 36. OA?
Join the discussion

by chatekar » Thu Jul 19, 2007 11:23 pm
In strict mathematical terms, in case of M = -12 and R = 36,
The distance OM is -3 times distance OR.

Please correct me if I'm wrong.

Thanks
Join the discussion

by Bhandaripreeti » Thu Jul 19, 2007 11:41 pm
Thanks ,

the OA is E
Join the discussion

by Bhandaripreeti » Thu Jul 19, 2007 11:49 pm
Hi erdnah,

Is there a algebraic eqn /method for solving this . I also chose C as the answer assuming the values to be 6 and 18.
Join the discussion

by erdnah » Thu Jul 19, 2007 11:57 pm
Of course there'll be a method to solve this, but I don't know it; if got a meeting in a min, perhaps I'll find some seconds to think about it :wink:
The important thing is, that it is asked for the distance, which can never be negative (move 0 to 12 and you should still get two - complete positive - solutions).
Join the discussion

by jay2007 » Tue Jul 24, 2007 10:41 pm
Statement 1 is obviously not sufficient and so is Statement# 2

Combining Statement1 and Statement2:

R HAS to lie on the positive side of zero, because 12 is in the middle of M & R.

Scenario A:
========
M lies on the positive size of 0(zero). Point P represents number 12. The points are in the following order: O M P R.

OM = x,
MP = PR = y, say. (from statement# 2)
OR = x+2y = 3(OM) (from statement #1)
x+2y = 3x, therefore x = y

Also, x+y = 12(from statement# 1). therefore x = 6 and R=18

Scenario B:
=======
M lies on the negative side of 0(zero). Point P represents number 12. The points are in the following order: M O P R

MO = x,
MP = PR = y, say (from statement# 2)
OR = 2y-x = 3OM
2y-x = 3x => y = 2x.

Also MP - OM = OP = 12
y - x = 12 => x = 12.
Therefore y = 24. Hence R is 36.

Hence the answer is E.
Join the discussion