Last visit was: 17 Jul 2025, 05:54 It is currently 17 Jul 2025, 05:54
Close
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
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.
Close
Request Expert Reply
Confirm Cancel
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 17 Jul 2025
Posts: 102,601
Own Kudos:
Given Kudos: 98,220
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,601
Kudos: 742,140
 [13]
2
Kudos
Add Kudos
11
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
IanStewart
User avatar
GMAT Tutor
Joined: 24 Jun 2008
Last visit: 17 July 2025
Posts: 4,144
Own Kudos:
10,632
 [6]
Given Kudos: 97
 Q51  V47
Expert
Expert reply
Posts: 4,144
Kudos: 10,632
 [6]
6
Kudos
Add Kudos
Bookmarks
Bookmark this Post
General Discussion
avatar
DongminShin
Joined: 12 Nov 2020
Last visit: 27 Jun 2021
Posts: 9
Own Kudos:
Given Kudos: 26
Posts: 9
Kudos: 8
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Kinshook
User avatar
Major Poster
Joined: 03 Jun 2019
Last visit: 16 Jul 2025
Posts: 5,703
Own Kudos:
Given Kudos: 161
Location: India
GMAT 1: 690 Q50 V34
WE:Engineering (Transportation)
Products:
GMAT 1: 690 Q50 V34
Posts: 5,703
Kudos: 5,228
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Asked: How many divisors does the positive integer n have?


(1) \(27n^3\) has 16 factors.
3^3*n^3 has 16 factors
(3+1)(3+1) = 16
n is a prime number
n has 2 divisors
SUFFICIENT

(2) \(90 < n^3 < 200\)
n=5; n^3 = 125
n has 2 divisors
SUFFICIENT

IMO D



Project DS Butler Data Sufficiency (DS3)


For DS butler Questions Click Here
[/quote]
avatar
DongminShin
Joined: 12 Nov 2020
Last visit: 27 Jun 2021
Posts: 9
Own Kudos:
Given Kudos: 26
Posts: 9
Kudos: 8
Kudos
Add Kudos
Bookmarks
Bookmark this Post
IanStewart
I'm implicitly using the method to count divisors from a prime factorization below - if that method is unfamiliar to anyone reading, this solution will not make sense:

Using Statement 1 alone, if n is not divisible by 3, then the only way (3^3)(n^3) can have 16 factors is if n is prime. So n might be a prime number, and have only two divisors.

But there's another possibility: n might be a power of 3. If n = 3^4, then (3^3)(n^3) = (3^3)(3^12) = 3^15, which also has 16 divisors. So n might equal 3^4, which has five divisors, and Statement 1 is not sufficient.

Statement 2 tells us n = 5 so it is sufficient, and the answer is B.

I have neglected the fact that n can be 3^4, not only prime number.
Thank you so much for your explanation!

Posted from my mobile device
User avatar
exc4libur
Joined: 24 Nov 2016
Last visit: 22 Mar 2022
Posts: 1,702
Own Kudos:
1,431
 [1]
Given Kudos: 607
Location: United States
Posts: 1,702
Kudos: 1,431
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
How many divisors does the positive integer n have?


(1) \(27n^3\) has 16 factors.

(2) \(90 < n^3 < 200\)

f(n:posinteger)=?

(1) insufic
f(3^3n^3)=16
n=prime!=3: (3+1)(3+1)=16, n has 2 factors
n=3^4: 3^3(3^12)=3^15=16 factors, n has 5 factors

(2) sufic
4^3=64, 5^3=125, 6^3=216
n=5

(B)
User avatar
Pankaj0901
Joined: 18 Dec 2018
Last visit: 17 Dec 2022
Posts: 419
Own Kudos:
Given Kudos: 737
Location: India
WE:Account Management (Hospitality and Tourism)
Posts: 419
Kudos: 50
Kudos
Add Kudos
Bookmarks
Bookmark this Post


(1) 27n327n3 has 16 factors.
3^3*n^3 has 16 factors
(3+1)(X) factors = 16
n must be a prime number => n has 2 divisors
SUFFICIENT

(2) 90<n3<20090<n3<200
Only n=5 is possible in this range; n^3 = 125
n has 2 divisors
SUFFICIENT

=> Both are sufficient!
IMO D


Bunuel
How many divisors does the positive integer n have?


(1) \(27n^3\) has 16 factors.

(2) \(90 < n^3 < 200\)



Project DS Butler Data Sufficiency (DS3)


For DS butler Questions Click Here
User avatar
Pankaj0901
Joined: 18 Dec 2018
Last visit: 17 Dec 2022
Posts: 419
Own Kudos:
Given Kudos: 737
Location: India
WE:Account Management (Hospitality and Tourism)
Posts: 419
Kudos: 50
Kudos
Add Kudos
Bookmarks
Bookmark this Post
IanStewart
Nice! missed the other possibility. How did you think so? Would be great if you could please share your insights on the thought process here.

IanStewart
I'm implicitly using the method to count divisors from a prime factorization below - if that method is unfamiliar to anyone reading, this solution will not make sense:

Using Statement 1 alone, if n is not divisible by 3, then the only way (3^3)(n^3) can have 16 factors is if n is prime. So n might be a prime number, and have only two divisors.

But there's another possibility: n might be a power of 3. If n = 3^4, then (3^3)(n^3) = (3^3)(3^12) = 3^15, which also has 16 divisors. So n might equal 3^4, which has five divisors, and Statement 1 is not sufficient.

Statement 2 tells us n = 5 so it is sufficient, and the answer is B.
User avatar
IanStewart
User avatar
GMAT Tutor
Joined: 24 Jun 2008
Last visit: 17 July 2025
Posts: 4,144
Own Kudos:
10,632
 [3]
Given Kudos: 97
 Q51  V47
Expert
Expert reply
Posts: 4,144
Kudos: 10,632
 [3]
3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Pankaj0901
IanStewart
Nice! missed the other possibility. How did you think so? Would be great if you could please share your insights on the thought process here.

If you know, for example, that the integer n has 100 positive divisors, and you want to imagine what the prime factorization of n might look like, there are lots of possibilities -- it might look like p^4 * q^4 * r * s, say, or like p^49 * q. But the simplest possibility is that the prime factorization looks like p^99. Since we very often want to come up with the simplest possible examples when trying to prove a DS statement is not sufficient, in questions like the one in this thread, the example that occurs to me first is that the number might be 3^15. It then became a question of whether there was a second possible scenario, and there is, 3^3 * p^3.

I'd add though that it's not likely to be important on the actual GMAT to know how to think up simple numbers when you're told "positive integer k has 12 divisors". It seems there's dozens upon dozens of questions on this forum, and in prep company books, about counting divisors. Questions about that do occasionally appear on the GMAT, but they are rare, and they seem to almost never be as complicated as most company questions about the subject.
avatar
Pallavi2020
Joined: 08 Sep 2019
Last visit: 14 Jul 2022
Posts: 25
Own Kudos:
Given Kudos: 88
Location: India
WE:Consulting (Non-Profit and Government)
Posts: 25
Kudos: 23
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Statement 1 : 27*n^3 = 3^3 *n^3; now this has 4*x =16 factors that means n^3 has total 4 factors. These 4 factors could be same numbers or different numbers -> hence not sufficient.

Statement 2: 90< n^3 <200 -> only 5 satisfies the condition -> sufficient

Hence answer is B
User avatar
Pankaj0901
Joined: 18 Dec 2018
Last visit: 17 Dec 2022
Posts: 419
Own Kudos:
Given Kudos: 737
Location: India
WE:Account Management (Hospitality and Tourism)
Posts: 419
Kudos: 50
Kudos
Add Kudos
Bookmarks
Bookmark this Post
IanStewart - Thanks a lot! :please:

IanStewart
Pankaj0901
IanStewart
Nice! missed the other possibility. How did you think so? Would be great if you could please share your insights on the thought process here.

If you know, for example, that the integer n has 100 positive divisors, and you want to imagine what the prime factorization of n might look like, there are lots of possibilities -- it might look like p^4 * q^4 * r * s, say, or like p^49 * q. But the simplest possibility is that the prime factorization looks like p^99. Since we very often want to come up with the simplest possible examples when trying to prove a DS statement is not sufficient, in questions like the one in this thread, the example that occurs to me first is that the number might be 3^15. It then became a question of whether there was a second possible scenario, and there is, 3^3 * p^3.

I'd add though that it's not likely to be important on the actual GMAT to know how to think up simple numbers when you're told "positive integer k has 12 divisors". It seems there's dozens upon dozens of questions on this forum, and in prep company books, about counting divisors. Questions about that do occasionally appear on the GMAT, but they are rare, and they seem to almost never be as complicated as most company questions about the subject.
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 37,434
Own Kudos:
Posts: 37,434
Kudos: 1,013
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.
Moderators:
Math Expert
102601 posts
453 posts