NEW HERE? LEARN MORE
closeclose
Last visit was: 03 May 2024, 21:47 It is currently 03 May 2024, 21:47
Decision Tracker
My Rewards
New posts
New comers' posts

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.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel

If n=3*4*p where p is a prime number greater than 3,how many different

SORT BY:
Date
Kudos
Tags:
Find Similar Topics 
Show Tags
Hide Tags
User avatar
B
snorkeler
Intern
Intern
Joined: 14 Dec 2015
Posts: 39
Own Kudos [?]: 248 [15]
Given Kudos: 46
Concentration: Entrepreneurship, General Management
WE:Information Technology (Computer Software)
Send PM
If n=3*4*p where p is a prime number greater than 3,how many different [#permalink] New post   Updated on: 10 Jan 2017, 20:13
2
Kudos
13
Bookmarks
00:00
A
B
C
D
E

Difficulty:

75% (hard)

Question Stats:

49% (01:44) correct 51% (01:51) wrong based on 194 sessions
Hide Show timer Statistics
If n=3*4*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

Source->Prep4Gmat
ShowHide Answer
Official Answer
B

Originally posted by snorkeler on 08 Jun 2016, 23:58.
Last edited by stonecold on 10 Jan 2017, 20:13, edited 2 times in total.
Renamed the topic and edited the question.
User avatar
L
Bunuel
Math Expert
Joined: 02 Sep 2009
Posts: 93025
Own Kudos [?]: 621026 [1]
Given Kudos: 81742
Send PM
CAT Tests Forum Quiz Mode
Re: If n=3*4*p where p is a prime number greater than 3,how many different [#permalink] New post   09 Jun 2016, 02:25
1
Kudos
Expert Reply
snorkeler wrote:
If n=3*4*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


Similar questions to practice:
if-n-2pq-where-p-and-q-are-distinct-prime-numbers-greater-148939.html
if-n-4p-where-p-is-a-prime-number-greater-than-2-how-man-144781.html
if-n-is-a-prime-number-greater-than-3-what-is-the-remainder-137869.html
avatar
neverplayd
Intern
Intern
Joined: 08 Aug 2016
Posts: 4
Own Kudos [?]: 2 [2]
Given Kudos: 0
Send PM
Re: If n=3*4*p where p is a prime number greater than 3,how many different [#permalink] New post   Updated on: 28 Aug 2016, 10:26
1
Kudos
1
Bookmarks
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?

Originally posted by neverplayd on 28 Aug 2016, 10:05.
Last edited by Bunuel on 28 Aug 2016, 10:26, edited 1 time in total.
Edited the question.
User avatar
L
abhimahna
Board of Directors
Joined: 18 Jul 2015
Status:Emory Goizueta Alum
Posts: 3600
Own Kudos [?]: 5431 [1]
Given Kudos: 346
Send PM
Reviews Badge
Re: If n=3*4*p where p is a prime number greater than 3,how many different [#permalink] New post   28 Aug 2016, 10:20
1
Kudos
Expert Reply
neverplayd wrote:
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
D
Kurtosis
Current Student
Joined: 13 Apr 2015
Posts: 1436
Own Kudos [?]: 4550 [0]
Given Kudos: 1228
Location: India
Send PM
GMAT ToolKit User Reviews Badge
Re: If n=3*4*p where p is a prime number greater than 3,how many different [#permalink] New post   09 Jun 2016, 00:22
\(n = 3 * 2^2 * p\)

Number of divisors = 2 * 3 * 2 = 12
The 12 divisors includes 1, n, 3, 2 and p

Number of different non prime divisors excluding 1 and n = 12 - 5 = 7

Answer: B
User avatar
Cosmas
Intern
Intern
Joined: 10 Apr 2012
Posts: 31
Own Kudos [?]: 47 [0]
Given Kudos: 13
Concentration: Finance
Schools: Goizueta '19 (I)
WE:Analyst (Commercial Banking)
Send PM
Reviews Badge
Re: If n=3*4*p where p is a prime number greater than 3,how many different [#permalink] New post   28 Aug 2016, 12:43
How did you determine the power of 'p'. Why did you assume p^1?


abhimahna wrote:
neverplayd wrote:
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
L
abhimahna
Board of Directors
Joined: 18 Jul 2015
Status:Emory Goizueta Alum
Posts: 3600
Own Kudos [?]: 5431 [0]
Given Kudos: 346
Send PM
Reviews Badge
Re: If n=3*4*p where p is a prime number greater than 3,how many different [#permalink] New post   29 Aug 2016, 12:37
Expert Reply
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
D
stonecold
Alum
Joined: 12 Aug 2015
Posts: 2281
Own Kudos [?]: 3141 [0]
Given Kudos: 893
Schools: Boston U '20 (M)
GRE 1: Q169 V154
Send PM
GMAT ToolKit User
Re: If n=3*4*p where p is a prime number greater than 3,how many different [#permalink] New post   10 Jan 2017, 20:11
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
Non-Human User
Joined: 09 Sep 2013
Posts: 32804
Own Kudos [?]: 825 [0]
Given Kudos: 0
Send PM
Re: If n=3*4*p where p is a prime number greater than 3,how many different [#permalink] New post   06 May 2023, 01:21
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.
GMAT Club Bot
gmatclubot
Re: If n=3*4*p where p is a prime number greater than 3,how many different [#permalink]
06 May 2023, 01:21
Moderators:
Bunuel
Math Expert
93025 posts
yashikaaggarwal
Senior Moderator - Masters Forum
3137 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne
Main navigation
GMAT Resources
Partners
MBA Resources
www.gmac.com|www.mba.com | | GMAT Club Rules | Terms and Conditions