GMAT Question of the Day - Daily to your Mailbox; hard ones only

 It is currently 21 Jun 2018, 07:15

### GMAT Club Daily Prep

#### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# If p and q are prime numbers, how many divisors does the

 post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
Intern
Joined: 05 Dec 2008
Posts: 20
If p and q are prime numbers, how many divisors does the [#permalink]

### Show Tags

06 Dec 2008, 19:29
If p and q are prime numbers, how many divisors does the product (p^5)(q^8) have?

(A) 13
(B) 25
(C) 40
(D) 48
(E) 54

--== Message from GMAT Club Team ==--

This is not a quality discussion. It has been retired.

If you would like to discuss this question please re-post it in the respective forum. Thank you!

To review the GMAT Club's Forums Posting Guidelines, please follow these links: Quantitative | Verbal Please note - we may remove posts that do not follow our posting guidelines. Thank you.
Manager
Joined: 23 Nov 2008
Posts: 77
Re: Counting challenge question #2 (harder) [#permalink]

### Show Tags

06 Dec 2008, 19:54
Should be 6*9 = 54

p^5q^8 will give us 5*8 combinations, also need to add those with only p or q
easier to simply include p^0 and q^0, and use 6 and 9
Intern
Joined: 26 Sep 2008
Posts: 19
Re: Counting challenge question #2 (harder) [#permalink]

### Show Tags

07 Dec 2008, 20:54
Yes, exactly 54
the form of factors of (p^5)(q^8) is (p^m)(q^n),in which:
0<=m<=5(6 values); 0<=n<=8 (9 valuess)
So there are 6*9=54 factors.

--== Message from GMAT Club Team ==--

This is not a quality discussion. It has been retired.

If you would like to discuss this question please re-post it in the respective forum. Thank you!

To review the GMAT Club's Forums Posting Guidelines, please follow these links: Quantitative | Verbal Please note - we may remove posts that do not follow our posting guidelines. Thank you.
Re: Counting challenge question #2 (harder)   [#permalink] 07 Dec 2008, 20:54
Display posts from previous: Sort by

# If p and q are prime numbers, how many divisors does the

 post reply Question banks Downloads My Bookmarks Reviews Important topics

Moderator: chetan2u

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.