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.

question on GMAT Prep exam

Expert replies
by oberlove » Wed Oct 20, 2010 7:16 am
I came across the problem below on one of the GMAT Prep exams. Can someone help me figure out how to solve this problem? In general, I find these type of questions a real bear. Any general strategies in approaching them would also be appreciated. Thanks!

If the prime numbers 'p' and 't' are the only prime factors of the integer 'm', is 'm' a multiple of p^2*t?
(i) 'm' has more than 9 positive factors
(ii) 'm' is a multiple of p^3
Join the discussion
Source: — Data Sufficiency |

by Rahul@gurome » Wed Oct 20, 2010 7:52 am
Given: The prime numbers 'p' and 't' are the only prime factors of the integer 'm'.
=> m = (p^a)*(t^b) , where a and b are greater than or equal to 1. In simple words, m is composed of one or more p's and one or more t's.

Now one possible case is m = pt. In this case, m is not a multiple of p^2*t. Therefore we need more information.

Statement 1: m has more than 9 positive factors.
=> m is composed of more than one p's and/or more than one t's.

Some possible cases are m = p*t^k , where k is greater than or equal to 4. In these cases m has more than 9 positive factors.

Like for k = 4, m = p*t^4. The factors are 1, p, t, t^2, t^3, t^4, pt, p*t^2, p*t^3 and p*t^4.

But in these cases, m is not a multiple of p^2*t.

Not SUFFICIENT.

Statement 2: m is multiple of p^3.
=> m = (p^3)^a*t^b , where a and b are greater than or equal to 1. In simple words, m is composed of three or more p's and one or more t's.

Thus m always contains p^2*t in it. Because, m is multiple p^3 => m is multiple of p^2 and m has t as a prime factor => m is a multiple of t. Thus, m is multiple of p^2*t.

SUFFICIENT.

The correct answer is B.
Last edited by Rahul@gurome on Wed Oct 20, 2010 8:11 am, edited 1 time in total.
Rahul Lakhani
Quant Expert
Gurome, Inc.
https://www.GuroMe.com
On MBA sabbatical (at ISB) for 2011-12 - will stay active as time permits
1-800-566-4043 (USA)
+91-99201 32411 (India)
Join the discussion

by shovan85 » Wed Oct 20, 2010 7:54 am
There is a formula you should know of:

N = a^x*b^y*c^z where a b c are distinct prime numbers and x y and z are corresponding powers then
Total number of factors = (x+1)*(y+1)*(z+1)

first break the number to all possible prime numbers (along with the powers) Then add one to each power and multiple.

Try the same for 36 = 2^2 * 3^2
Total factors = (2+1)*(2+1) = 9 which are [1,2,3,4,6,9,12,18,36]

Now,

m has only two PRIME factors so we can have other factors but those will not be prime.

1. m has more than 9 positive factors:

so there is no guarantee that the m will be a multiple of (p^2)*t.

For example if I take m = p*(t^5) then total number of factors of m = (1+1)*(5+1) = 12 which is > 9.

So not sufficient.

2. m is a multiple of p^3.

so we can write m = (p^3)* (t^x) ; x in the sense any integer > 0 as t has to be a factor of m (mentioned in the Q)

Clearly P^2 is a factor of p^3
[As p^3 can be written as p*(p^2)]

Thus Sufficient.

IMO
B
If the problem is Easy Respect it, if the problem is tough Attack it
Join the discussion