the product p^3 q^6

This topic has expert replies
User avatar
GMAT Instructor
Posts: 3650
Joined: Wed Jan 21, 2009 4:27 am
Location: India
Thanked: 267 times
Followed by:80 members
GMAT Score:760

the product p^3 q^6

by sanju09 » Wed Sep 15, 2010 9:41 pm
If p and q are prime numbers, how many divisors does the product p^3 q^6 have?
(A) 9
(B) 12
(C) 18
(D) 28
(E) 36


[spoiler]Source: https://readyforgmat.com[/spoiler]
The mind is everything. What you think you become. -Lord Buddha



Sanjeev K Saxena
Quantitative Instructor
The Princeton Review - Manya Abroad
Lucknow-226001

www.manyagroup.com
Source: — Problem Solving |

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 1179
Joined: Sun Apr 11, 2010 9:07 pm
Location: Milpitas, CA
Thanked: 447 times
Followed by:88 members

by Rahul@gurome » Wed Sep 15, 2010 11:37 pm
Number of divisors that p^3*q^6 have is (3 + 1) * (6 + 1) = 4 * 7 = 28

The correct answer is [spoiler](D)[/spoiler].
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)

User avatar
GMAT Instructor
Posts: 1031
Joined: Thu Jul 03, 2008 1:23 pm
Location: Malibu, CA
Thanked: 716 times
Followed by:255 members
GMAT Score:750

by Brian@VeritasPrep » Thu Sep 16, 2010 9:35 am
Hey everyone:

Rahul is right - the method he used is a somewhat obscure trick for "how many unique factors" questions. For a thorough breakdown you can check out a blog post I wrote here:

https://blog.veritasprep.com/2009/12/gma ... -week.html

That rule works essentially by using combinatorics logic - it's really a combinations problem (how many unique combinations of 3 ps and 6 qs can you create...plus there's also 1 which is a factor of everything). If you don't have the rule on this one - and it's obscure enough a rule that most GMAT takers won't have it memorized - you can work out the combinations pretty efficiently on your own. Keep in mind that, with the answer choices spread out the way they are, if you're close to the exact number you can be pretty certain you've got it.

Here's my breakdown (using 2^6 and 3^3 just because numbers seem more comfortable and easier to check):
1 (1 is a factor of all positive integers - 1 factor)
2^1 through 2^6 ---> 6 factors
3^1 through 3^3 --> 3 factors
2*3
2*2*3
2*2*2*3
2*2*2*2*3
2*2*2*2*2*3
2*2*2*2*2*2*3 (kind of a pyramid structure...each potential number of 2s multiplied by one 3 - there are 6 of those)
Same thing as the above pyramid, but with two 3s: Another 6 unique factors
Same thing as the above with all three 3s: Another 6 unique factors

Add up all of those factors and you're at 28, which is choice D. If you can find just one more you'll have to pick E since D is too small, but we can't. Even if we start with 3s:

3*2 (already covered)
3*2*2 (already covered) etc.

We've already covered all of the combinations of 2s and 3s, so we know that the correct answer is 28.

If you're organized and look for opportunities to streamline the work (such as replicating that pyramid structure for one 3, two 3s, three 3s), finding 28 unique factors can be done in a minute or 90 seconds...remember, you don't care what the factors are, just that they exist, so you don't need to actually do the calculations.
Brian Galvin
GMAT Instructor
Chief Academic Officer
Veritas Prep

Looking for GMAT practice questions? Try out the Veritas Prep Question Bank. Learn More.

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 2623
Joined: Mon Jun 02, 2008 3:17 am
Location: Montreal
Thanked: 1090 times
Followed by:355 members
GMAT Score:780

by Ian Stewart » Thu Sep 16, 2010 10:35 am
sanju09 wrote:If p and q are prime numbers, how many divisors does the product p^3 q^6 have?
(A) 9
(B) 12
(C) 18
(D) 28
(E) 36


[spoiler]Source: https://readyforgmat.com[/spoiler]
Not a well-written question. If p and q are different primes, the answer is (3+1)(6+1) = 28, as has been explained above. If p and q are the same prime - and we have no reason to think they need to be different from the wording of the question - the answer is 10. So there is not a unique correct answer here.
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

Senior | Next Rank: 100 Posts
Posts: 36
Joined: Thu Dec 31, 2009 5:54 am
Location: New York City
Thanked: 2 times

by bdevas01 » Thu Sep 16, 2010 5:55 pm
Hey Ian,

could you clarify if they were both the same number the answer would be 10?

I didn't quite understand that part. Thanks!

User avatar
GMAT Instructor
Posts: 3650
Joined: Wed Jan 21, 2009 4:27 am
Location: India
Thanked: 267 times
Followed by:80 members
GMAT Score:760

by sanju09 » Thu Sep 16, 2010 9:22 pm
bdevas01 wrote:Hey Ian,

could you clarify if they were both the same number the answer would be 10?

I didn't quite understand that part. Thanks!
When a composite is written to primes, the composite could be represented as the product like this one: p^3 q^6, where p and q are the only primes involved in building the composite and 3 and 6 are the numbers of their appearances. The total number of divisors is given by the product of the numbers obtained after adding 1 to the numbers of appearances of the primes involved. In this case, if we are sure that p ≠ q, the total number of divisors is 4 × 7 = 28. This, according to Ian, is fittingly missing in the question.

If p = q, then the product p^3 q^6 = p^9 or q^9, we need not to look for the product of anything, as this is made up of a single prime, just add 1 to 9 and answer 10.
The mind is everything. What you think you become. -Lord Buddha



Sanjeev K Saxena
Quantitative Instructor
The Princeton Review - Manya Abroad
Lucknow-226001

www.manyagroup.com

User avatar
Legendary Member
Posts: 866
Joined: Mon Aug 02, 2010 6:46 pm
Location: Gwalior, India
Thanked: 31 times

by goyalsau » Fri Sep 17, 2010 12:02 am
sanju09 wrote:
bdevas01 wrote:Hey Ian,

could you clarify if they were both the same number the answer would be 10?

I didn't quite understand that part. Thanks!
When a composite is written to primes, the composite could be represented as the product like this one: p^3 q^6, where p and q are the only primes involved in building the composite and 3 and 6 are the numbers of their appearances. The total number of divisors is given by the product of the numbers obtained after adding 1 to the numbers of appearances of the primes involved. In this case, if we are sure that p ≠ q, the total number of divisors is 4 × 7 = 28. This, according to Ian, is fittingly missing in the question.

If p = q, then the product p^3 q^6 = p^9 or q^9, we need not to look for the product of anything, as this is made up of a single prime, just add 1 to 9 and answer 10.
Nice explanation Sanju..