• Magoosh
Study with Magoosh GMAT prep

Available with Beat the GMAT members only code

• Free Trial & Practice Exam
BEAT THE GMAT EXCLUSIVE

Available with Beat the GMAT members only code

• 5-Day Free Trial
5-day free, full-access trial TTP Quant

Available with Beat the GMAT members only code

• FREE GMAT Exam
Know how you'd score today for $0 Available with Beat the GMAT members only code • 1 Hour Free BEAT THE GMAT EXCLUSIVE Available with Beat the GMAT members only code • Free Veritas GMAT Class Experience Lesson 1 Live Free Available with Beat the GMAT members only code • Get 300+ Practice Questions 25 Video lessons and 6 Webinars for FREE Available with Beat the GMAT members only code • Free Practice Test & Review How would you score if you took the GMAT Available with Beat the GMAT members only code • Award-winning private GMAT tutoring Register now and save up to$200

Available with Beat the GMAT members only code

• 5 Day FREE Trial
Study Smarter, Not Harder

Available with Beat the GMAT members only code

tagged by: M7MBA

# This topic has 3 expert replies and 0 member replies

#### If m, p, and t are distinct positive prime numbers

If m, p, and t are distinct positive prime numbers, then (m^3)(p)(t) has how many different positive factors greater than 1?

a. 8
b. 9
c. 12
d. 15
e. 27

The OA is the option D.

How can I know the number of factor without knowing the value of m, p and t?

Experts, may you give me some help here? Please.

### GMAT/MBA Expert

GMAT Instructor
Joined
08 Dec 2008
Posted:
12127 messages
Followed by:
1237 members
5254
GMAT Score:
770
M7MBA wrote:
If m, p, and t are distinct positive prime numbers, then (m^3)(p)(t) has how many different positive factors greater than 1?

a. 8
b. 9
c. 12
d. 15
e. 27
----ASIDE---------------------
If the prime factorization of N = (p^a)(q^b)(r^c) . . . (where p, q, r, etc are different prime numbers), then N has a total of (a+1)(b+1)(c+1)(etc) positive divisors.

Example: 14000 = (2^4)(5^3)(7^1)
So, the number of positive divisors of 14000 = (4+1)(3+1)(1+1) =(5)(4)(2) = 40
-----ONTO THE QUESTION!!----------------------------

(m^3)(p)(t) = (m^3)(p^1)(t^1)
So, the number of positive divisors of (m^3)(p)(t) = (3+1)(1+1)(1+1) = (4)(2)(2) = 16

IMPORTANT: We have included 1 as one of the 16 factors in our solution above, but the question asks us to find the number of positive factors greater than 1.
So, the answer to the question = 16 - 1 = 15

Cheers,
Brent

_________________
Brent Hanneson – Creator of GMATPrepNow.com
Use our video course along with

And check out all of our free resources

GMAT Prep Now's comprehensive video course can be used in conjunction with Beat The GMAT’s FREE 60-Day Study Guide and reach your target score in 2 months!

### GMAT/MBA Expert

GMAT Instructor
Joined
25 Apr 2015
Posted:
1472 messages
Followed by:
13 members
43
M7MBA wrote:
If m, p, and t are distinct positive prime numbers, then (m^3)(p)(t) has how many different positive factors greater than 1?

a. 8
b. 9
c. 12
d. 15
e. 27
To determine the total number of factors of a number, we can add 1 to the exponent of each distinct prime factor and multiply together the resulting numbers.

Thus, (m^3)(p)(t) = (m^3)(p^1)(t^1) has (3 + 1)(1 + 1)(1 + 1) = 4 x 2 x 2 = 16 total factors. Since 1 is one of those 16 factors, there are actually 15 different positive factors greater than 1.

_________________
Scott Woodbury-Stewart Founder and CEO

Joined
31 Dec 1969

### Top First Responders*

1 Jay@ManhattanReview 81 first replies
2 Brent@GMATPrepNow 67 first replies
3 fskilnik 54 first replies
4 GMATGuruNY 37 first replies
5 Rich.C@EMPOWERgma... 13 first replies
* Only counts replies to topics started in last 30 days
See More Top Beat The GMAT Members

### Most Active Experts

1 fskilnik

GMAT Teacher

201 posts
2 Brent@GMATPrepNow

GMAT Prep Now Teacher

155 posts
3 Scott@TargetTestPrep

Target Test Prep

105 posts
4 Jay@ManhattanReview

Manhattan Review

97 posts
5 GMATGuruNY

The Princeton Review Teacher

91 posts
See More Top Beat The GMAT Experts