Last visit was: 23 Apr 2026, 20:43 It is currently 23 Apr 2026, 20:43
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
snorkeler
Joined: 14 Dec 2015
Last visit: 13 Apr 2020
Posts: 39
Own Kudos:
328
 [23]
Given Kudos: 46
Concentration: Entrepreneurship, General Management
WE:Information Technology (Computer Software)
Posts: 39
Kudos: 328
 [23]
2
Kudos
Add Kudos
21
Bookmarks
Bookmark this Post
User avatar
Kurtosis
User avatar
Current Student
Joined: 13 Apr 2015
Last visit: 10 Nov 2021
Posts: 1,384
Own Kudos:
5,236
 [1]
Given Kudos: 1,228
Location: India
Products:
Posts: 1,384
Kudos: 5,236
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 23 Apr 2026
Posts: 109,785
Own Kudos:
810,878
 [1]
Given Kudos: 105,853
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,785
Kudos: 810,878
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
avatar
neverplayd
Joined: 08 Aug 2016
Last visit: 12 Feb 2017
Posts: 4
Own Kudos:
2
 [2]
Posts: 4
Kudos: 2
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Hello, I'm new to this forum so sorry if this question is in the wrong place. I was working on a question in the Prep4GMAT number properties app and ran into this question (and solution):

If n = 3 x 4 x p, where p is a prime number greater than 3, how many different positive non-prime divisors does n have, excluding 1 and n?

a) Six
b) Seven
c) Eight
d) Nine
e) Ten

Here is the solution:
Show SpoilerSolution here
In this question, we are given n in a form^ that is almost its prime factorization, which is n = 2^2 x 3 x p. To determine the number of divisors sought, we essentially have to count different combinations of the factors. We can break down the possibilities by the number of prime factors used to form each divisor. We can't have any divisors of just one prime factor, because the question stipulates that we count "non-prime" divisors. In the case that our divisor has two factors, it could be (2) (2), or (2) (3), or (2) (p), or (3)(p) for a total of 4 possibilities. In the case that our divisor has three prime factors, it could be (2) (2) (3), or (2) (3) (p), or (2) (2) (p), for a total of 3 possibilities. The case that our divisor has four prime factors is out, because that equals n, an we have been told to exclude n. Therefore, we have 7 possibilities of the type described.

The solution provided by the app involves actually spelling out each combination which is fine with a set of factors that small but I assumed there would be a way to derive the answer from a permutation/combination formula: like 4!/2! or something similar?
User avatar
abhimahna
User avatar
Board of Directors
Joined: 18 Jul 2015
Last visit: 06 Jul 2024
Posts: 3,481
Own Kudos:
5,779
 [3]
Given Kudos: 346
Status:Emory Goizueta Alum
Products:
Expert
Expert reply
Posts: 3,481
Kudos: 5,779
 [3]
2
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
neverplayd
Hello, I'm new to this forum so sorry if this question is in the wrong place. I was working on a question in the Prep4GMAT number properties app and ran into this question (and solution):

If n = 3 x 4 x p, where p is a prime number greater than 3, how many different positive non-prime divisors does n have, excluding 1 and n?
a) Six
b) Seven
c) Eight
d) Nine
e) Ten

Here is the solution:
Show SpoilerSolution here
In this question, we are given n in a form^ that is almost its prime factorization, which is n = 2^2 x 3 x p. To determine the number of divisors sought, we essentially have to count different combinations of the factors. We can break down the possibilities by the number of prime factors used to form each divisor. We can't have any divisors of just one prime factor, because the question stipulates that we count "non-prime" divisors. In the case that our divisor has two factors, it could be (2) (2), or (2) (3), or (2) (p), or (3)(p) for a total of 4 possibilities. In the case that our divisor has three prime factors, it could be (2) (2) (3), or (2) (3) (p), or (2) (2) (p), for a total of 3 possibilities. The case that our divisor has four prime factors is out, because that equals n, an we have been told to exclude n. Therefore, we have 7 possibilities of the type described.

The solution provided by the app involves actually spelling out each combination which is fine with a set of factors that small but I assumed there would be a way to derive the answer from a permutation/combination formula: like 4!/2! or something similar?

An Easy way to solve this question :

Remember the method to find the number of factors of any integer?

If No, here it is :

If \(N = X^a * Y^b\) where X and Y are prime,

then number of factors of N are given by the formula (a+1)(b+1) { Notice I have simply increased the powers of X and Y by one and then multiplied them. Also Make sure X and Y are DISTINCT primes)

So, in your question, n = 3 x 4 x p, where p is prime.

I can \(n=3^1*2^2*p^1\)

or number of factors = (1+1) * (2+1) * (1+1) = 12.

But Notice we need to find Non prime and Other than 1 and n, so we have three prime numbers (2,3,p) , 1 and N.

Excluding these, we have 12-5 = 7 such factors. Hence Answer is B
User avatar
Cosmas
Joined: 10 Apr 2012
Last visit: 20 Sep 2016
Posts: 31
Own Kudos:
Given Kudos: 13
Concentration: Finance
WE:Analyst (Commercial Banking)
Products:
Posts: 31
Kudos: 58
Kudos
Add Kudos
Bookmarks
Bookmark this Post
How did you determine the power of 'p'. Why did you assume p^1?


abhimahna
neverplayd
Hello, I'm new to this forum so sorry if this question is in the wrong place. I was working on a question in the Prep4GMAT number properties app and ran into this question (and solution):

If n = 3 x 4 x p, where p is a prime number greater than 3, how many different positive non-prime divisors does n have, excluding 1 and n?
a) Six
b) Seven
c) Eight
d) Nine
e) Ten

Here is the solution:
Show SpoilerSolution here
In this question, we are given n in a form^ that is almost its prime factorization, which is n = 2^2 x 3 x p. To determine the number of divisors sought, we essentially have to count different combinations of the factors. We can break down the possibilities by the number of prime factors used to form each divisor. We can't have any divisors of just one prime factor, because the question stipulates that we count "non-prime" divisors. In the case that our divisor has two factors, it could be (2) (2), or (2) (3), or (2) (p), or (3)(p) for a total of 4 possibilities. In the case that our divisor has three prime factors, it could be (2) (2) (3), or (2) (3) (p), or (2) (2) (p), for a total of 3 possibilities. The case that our divisor has four prime factors is out, because that equals n, an we have been told to exclude n. Therefore, we have 7 possibilities of the type described.

The solution provided by the app involves actually spelling out each combination which is fine with a set of factors that small but I assumed there would be a way to derive the answer from a permutation/combination formula: like 4!/2! or something similar?

An Easy way to solve this question :

Remember the method to find the number of factors of any integer?

If No, here it is :

If \(N = X^a * Y^b\) where X and Y are prime,

then number of factors of N are given by the formula (a+1)(b+1) { Notice I have simply increased the powers of X and Y by one and then multiplied them. Also Make sure X and Y are DISTINCT primes)

So, in your question, n = 3 x 4 x p, where p is prime.

I can \(n=3^1*2^2*p^1\)

or number of factors = (1+1) * (2+1) * (1+1) = 12.

But Notice we need to find Non prime and Other than 1 and n, so we have three prime numbers (2,3,p) , 1 and N.

Excluding these, we have 12-5 = 7 such factors. Hence Answer is B
User avatar
abhimahna
User avatar
Board of Directors
Joined: 18 Jul 2015
Last visit: 06 Jul 2024
Posts: 3,481
Own Kudos:
Given Kudos: 346
Status:Emory Goizueta Alum
Products:
Expert
Expert reply
Posts: 3,481
Kudos: 5,779
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Notice we are given that p is prime.

Since a prime no. cannot be factorized further, it will always have a power of one. Take any prime number, you will be able to understand what I am saying

Posted from my mobile device
User avatar
stonecold
Joined: 12 Aug 2015
Last visit: 09 Apr 2024
Posts: 2,231
Own Kudos:
Given Kudos: 893
GRE 1: Q169 V154
GRE 1: Q169 V154
Posts: 2,231
Kudos: 3,643
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Great Question.
Here is what i did in this one=>
n=2^2*3*p where p is a prime greater than 3
number of divisors => 3*2*2=> 12 including => 1,2,3,p,n
hence excluding the above divisors => 12-5 => Seven
Hence B
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,960
Own Kudos:
Posts: 38,960
Kudos: 1,117
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Automated notice from GMAT Club BumpBot:

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

This post was generated automatically.
Moderators:
Math Expert
109785 posts
Tuck School Moderator
853 posts