Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Does GMAT RC seem like an uphill battle? e-GMAT is conducting a free webinar to help you learn reading strategies that can enable you to solve 700+ level RC questions with at least 90% accuracy in less than 10 days.

Sign up or for Target Test Prep’s weekly Quant webinar series. The free weekly webinar covers sophisticated, yet easy-to-deploy, tactics and strategies for handling commonly misunderstood, high-value GMAT quant problems.

Enter The Economist GMAT Tutor’s Brightest Minds competition – it’s completely free! All you have to do is take our online GMAT simulation test and put your mind to the test. Are you ready? This competition closes on December 13th.

Re: If m, p, and t are distinct positive prime numbers, then (m^3)(p)(t)
[#permalink]

Show Tags

21 Apr 2016, 23:18

12

11

happyface101 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

Number of factors of (2^a)*(3^b)*(5^c) ... = (a+1)(b+1)(c+1) ...

If m, p and t are the distinct prime numbers, then the number is already represented in its prime factorization form Number of factors = (3+1)(1+1)(1+1) = 16 Out of these, one factor would be 1.

Hence different positive factors greater than 1 = 15 Correct Option: D

Re: If m, p, and t are distinct positive prime numbers, then (m^3)(p)(t)
[#permalink]

Show Tags

22 Apr 2016, 04:42

2

4

happyface101 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

Let Number is (m^3)(p)(t) = (2^3)(3)(5) = 120

We can write 120 as product of two numbers in following ways 1*120 2*60 3*40 4*30 5*24 6*20 8*15 10*12

8 cases = 8*2 i.e. 16 factors (including 1)

Factors greater than 1 = 15

Answer: Option D
_________________

Prosper!!! GMATinsight Bhoopendra Singh and Dr.Sushma Jha e-mail: info@GMATinsight.com I Call us : +91-9999687183 / 9891333772 Online One-on-One Skype based classes and Classroom Coaching in South and West Delhi http://www.GMATinsight.com/testimonials.html

Re: If m, p, and t are distinct positive prime numbers, then (m^3)(p)(t)
[#permalink]

Show Tags

20 Mar 2017, 06:48

2

2

happyface101 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 number 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.

Re: If m, p, and t are distinct positive prime numbers, then (m^3)(p)(t)
[#permalink]

Show Tags

01 Mar 2018, 10:34

1

Top Contributor

happyface101 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

Re: If m, p, and t are distinct positive prime numbers, then (m^3)(p)(t)
[#permalink]

Show Tags

04 Mar 2019, 08:05

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________