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 21
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE BOOTCAMP

Live Online Bootcamp Class with Top GMAT Expert Chris Peckover

Sep 21 to Oct 9, 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.

Great Questions! Need help, gmat tomo =(

Expert replies
by houstonrockets16 » Sun Jun 28, 2009 5:44 pm
The integers m and p are such that 2 < m < p and m is not a factor of p. If r is the remainder when p is divided by m, is r >1?

1) the greatest common factor of m and p is 2.
2) the least common multiple of m and p is 30.

I am trying to find a way to answer this question besides just guessing numbers. Can anyone help? Thanks so much

OA: A
Join the discussion
Source: — Data Sufficiency |

houstonrockets16 wrote:The integers m and p are such that 2 < m < p and m is not a factor of p. If r is the remainder when p is divided by m, is r >1?

1) the greatest common factor of m and p is 2.
2) the least common multiple of m and p is 30.

I am trying to find a way to answer this question besides just guessing numbers. Can anyone help? Thanks so much

OA: A
From the stem, we know that p is not divisible by m, so the remainder can't be 0 when p is divided by m. So r is either equal to 1, or r is greater than 1.

According to Statement 1, m and p are both even (both are divisible by 2). When you divide an even number by another even number, the remainder can't be odd. Since the remainder is not zero, it must be 2 or greater. Sufficient.

Statement 2 is not sufficient, though you really need to look at examples to see why. We may have that m = 5, p = 6, or we may have that m = 10, p = 15.
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

houstonrockets16 wrote:The integers m and p are such that 2 < m < p and m is not a factor of p. If r is the remainder when p is divided by m, is r >1?

1) the greatest common factor of m and p is 2.
2) the least common multiple of m and p is 30.

I am trying to find a way to answer this question besides just guessing numbers. Can anyone help? Thanks so much

OA: A
OA is correct infact this is a very trivial remainder theory concept..

when a number X is divided by number Y then the remainder left is always a multiple of HCF of X and Y ( provided x and y are integers) hence A is sufficient
Join the discussion