Last visit was: 26 Apr 2024, 02:30 It is currently 26 Apr 2024, 02:30

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
SORT BY:
Date
User avatar
Intern
Intern
Joined: 30 Sep 2010
Posts: 15
Own Kudos [?]: 610 [15]
Given Kudos: 1
Send PM
Most Helpful Reply
Math Expert
Joined: 02 Sep 2009
Posts: 92929
Own Kudos [?]: 619098 [7]
Given Kudos: 81609
Send PM
General Discussion
User avatar
Senior Manager
Senior Manager
Joined: 03 Feb 2011
Status:Impossible is not a fact. It's an opinion. It's a dare. Impossible is nothing.
Affiliations: University of Chicago Booth School of Business
Posts: 472
Own Kudos [?]: 892 [1]
Given Kudos: 123
Send PM
User avatar
Manager
Manager
Joined: 25 Aug 2008
Posts: 100
Own Kudos [?]: 294 [0]
Given Kudos: 5
Location: India
WE 1: 3.75 IT
WE 2: 1.0 IT
Send PM
Re: Number System [#permalink]
Understood y Statement 1 and statement 2 are eliminated.
But didn't understood how Both statements are sufficient.
Anyone pls help.
Retired Moderator
Joined: 05 Jul 2006
Posts: 849
Own Kudos [?]: 1562 [0]
Given Kudos: 49
Send PM
Re: Does the prime number p divide n!? [#permalink]
surendar26 wrote:
Does the prime number p divide n!?

(1) Prime number p divides n! + (n+2)!.
(2) The prime number p divides (n+2)!/n!.


P divides N only if p<=n

from 1

p divides n! [1+(n+1)(n+2)] thus p divides either n! or divides [1+(n+1)(n+2)) ... insufficient

from 2

p divides (n+1) (n+2) ... no mention whether it divides n! or not ... insuff

from both

1+(n+1)(n+2) and ( n+1) ( n+2) are co primes , i.e. no common divisor except 1

and since from 1
p divides n! [1+(n+1)(n+2)] and divides (n+1)(n+2) then it must divide n! ... suff

C
Manager
Manager
Joined: 19 Aug 2016
Posts: 56
Own Kudos [?]: 6 [0]
Given Kudos: 30
Send PM
Re: Does the prime number p divide n!? [#permalink]
yezz wrote:
surendar26 wrote:
Does the prime number p divide n!?

(1) Prime number p divides n! + (n+2)!.
(2) The prime number p divides (n+2)!/n!.


P divides N only if p<=n

from 1

p divides n! [1+(n+1)(n+2)] thus p divides either n! or divides [1+(n+1)(n+2)) ... insufficient

from 2

p divides (n+1) (n+2) ... no mention whether it divides n! or not ... insuff

from both

1+(n+1)(n+2) and ( n+1) ( n+2) are co primes , i.e. no common divisor except 1

and since from 1
p divides n! [1+(n+1)(n+2)] and divides (n+1)(n+2) then it must divide n! ... suff

C


Can u pls explain n! [1+(n+1)(n+2)] with steps?

Thanks
Retired Moderator
Joined: 05 Jul 2006
Posts: 849
Own Kudos [?]: 1562 [0]
Given Kudos: 49
Send PM
Re: Does the prime number p divide n!? [#permalink]
zanaik89 wrote:
yezz wrote:
surendar26 wrote:
Does the prime number p divide n!?

(1) Prime number p divides n! + (n+2)!.
(2) The prime number p divides (n+2)!/n!.


P divides N only if p<=n

from 1

p divides n! [1+(n+1)(n+2)] thus p divides either n! or divides [1+(n+1)(n+2)) ... insufficient

from 2

p divides (n+1) (n+2) ... no mention whether it divides n! or not ... insuff

from both

1+(n+1)(n+2) and ( n+1) ( n+2) are co primes , i.e. no common divisor except 1

and since from 1
p divides n! [1+(n+1)(n+2)] and divides (n+1)(n+2) then it must divide n! ... suff

C


Can u pls explain n! [1+(n+1)(n+2)] with steps?

Thanks


Just like 5! = 5*4*3....

(N+2)! = (n+2)(n+1)(n)(n-1)....
Thus , (N+2)! = (n+2)(n+1)*n!

So in n!+(n+2)! We can take n! As a common factor



Sent from my iPhone using GMAT Club Forum mobile app
Manager
Manager
Joined: 19 Aug 2016
Posts: 56
Own Kudos [?]: 6 [0]
Given Kudos: 30
Send PM
Does the prime number p divide n!? [#permalink]
Bunuel wrote:
surendar26 wrote:
Does the prime number p divide n!?

1. Prime number p divides n! + (n+2)!.
2. The prime number p divides (n+2)!/n!.


The question should be: is the prime number p a factor of n!, where n is a nonnegative integer.

(Basically the question asks whether \(p\leq{n}\))

(1) p is a factor of \(n!+(n+2)!\) --> \(p\) is a factor of \(n!(1+(n+1)(n+2))\).

Now, if \(p=3\) and \(n=0\) (\(n!+(n+2)!=1+2=3\)) then the answer will be NO: \(p=3\) is not a factor of \(n!=0!=1\).

But if \(p=2\) and \(n=2\) (\(n!+(n+2)!=2+24=26\)) then the answer will be YES: \(p=2\) is a factor of \(n!=2!=2\).

Two different answer, hence not sufficient.

(2) p is a factor of \(\frac{(n+2)!}{n!}\) --> \(p\) is a factor of \((n+1)(n+2)\).

Now, if \(p=2\) and \(n=0\) then the answer will be NO but if \(p=2\) and \(n=2\) then the answer will be YES. Not sufficient.

(1)+(2) Now, \((n+1)(n+2)\) and \((n+1)(n+2)+1\) are consecutive integers. Two consecutive integers are co-prime, which means that they don't share ANY common factor but 1. For example 20 and 21 are consecutive integers, thus only common factor they share is 1. So, as from (2) \(p\) is a factor of \((n+1)(n+2)\) then it can not be a factor of \((n+1)(n+2)+1\), thus in order \(p\) to be a factor of \(n!*((n+1)(n+2)+1)\), from (1), then it should be a factor of the first multiple of this expression: \(n!\). Sufficient.

Answer: C.


Hi Bunuel,

Can u please explain this part- [color=#ffff00]then it should be a factor of the first multiple of this expression: n![/color]

Originally posted by zanaik89 on 17 Oct 2017, 19:56.
Last edited by zanaik89 on 17 Oct 2017, 19:58, edited 1 time in total.
Math Expert
Joined: 02 Sep 2009
Posts: 92929
Own Kudos [?]: 619098 [0]
Given Kudos: 81609
Send PM
Re: Does the prime number p divide n!? [#permalink]
Expert Reply
zanaik89 wrote:
Bunuel wrote:
surendar26 wrote:
Does the prime number p divide n!?

1. Prime number p divides n! + (n+2)!.
2. The prime number p divides (n+2)!/n!.


The question should be: is the prime number p a factor of n!, where n is a nonnegative integer.

(Basically the question asks whether \(p\leq{n}\))

(1) p is a factor of \(n!+(n+2)!\) --> \(p\) is a factor of \(n!(1+(n+1)(n+2))\).

Now, if \(p=3\) and \(n=0\) (\(n!+(n+2)!=1+2=3\)) then the answer will be NO: \(p=3\) is not a factor of \(n!=0!=1\).

But if \(p=2\) and \(n=2\) (\(n!+(n+2)!=2+24=26\)) then the answer will be YES: \(p=2\) is a factor of \(n!=2!=2\).

Two different answer, hence not sufficient.

(2) p is a factor of \(\frac{(n+2)!}{n!}\) --> \(p\) is a factor of \((n+1)(n+2)\).

Now, if \(p=2\) and \(n=0\) then the answer will be NO but if \(p=2\) and \(n=2\) then the answer will be YES. Not sufficient.

(1)+(2) Now, \((n+1)(n+2)\) and \((n+1)(n+2)+1\) are consecutive integers. Two consecutive integers are co-prime, which means that they don't share ANY common factor but 1. For example 20 and 21 are consecutive integers, thus only common factor they share is 1. So, as from (2) \(p\) is a factor of \((n+1)(n+2)\) then it can not be a factor of \((n+1)(n+2)+1\), thus in order \(p\) to be a factor of \(n!*((n+1)(n+2)+1)\), from (1), then it should be a factor of the first multiple of this expression: \(n!\). Sufficient.

Answer: C.


Hi Bunuel,

Can u please explain this part- [color=#ffff00]then it should be a factor of the first multiple of this expression: n![/color]


p is NOT a factor of (n+1)(n+2)+1. For p to be a factor of n!*((n+1)(n+2)+1), it must be a factor of n!
Manager
Manager
Joined: 22 May 2017
Posts: 76
Own Kudos [?]: 16 [0]
Given Kudos: 223
Send PM
Does the prime number p divide n!? [#permalink]
yezz wrote:
surendar26 wrote:
Does the prime number p divide n!?

(1) Prime number p divides n! + (n+2)!.
(2) The prime number p divides (n+2)!/n!.


P divides N only if p<=n

from 1

p divides n! [1+(n+1)(n+2)] thus p divides either n! or divides [1+(n+1)(n+2)) ... insufficient

from 2

p divides (n+1) (n+2) ... no mention whether it divides n! or not ... insuff

from both

1+(n+1)(n+2) and ( n+1) ( n+2) are co primes , i.e. no common divisor except 1

and since from 1
p divides n! [1+(n+1)(n+2)] and divides (n+1)(n+2) then it must divide n! ... suff

C


I solve the problem in the same way. I will see my interpretation of result from solution of the statement1 that statement 1 has two answer but it answers the question that p divides n!

So please explain that how come your answer is C not A.

In my option, with above solution answer will be option A.

Originally posted by Adityagmatclub on 22 Oct 2017, 11:37.
Last edited by Adityagmatclub on 22 Oct 2017, 12:05, edited 1 time in total.
Retired Moderator
Joined: 05 Jul 2006
Posts: 849
Own Kudos [?]: 1562 [0]
Given Kudos: 49
Send PM
Re: Does the prime number p divide n!? [#permalink]
In 1 , we have an either or situation we can't be sure it divides n! Because equally probable it could divide ( 1+ ( n+1)+(n+2))


Sent from my iPhone using GMAT Club Forum
User avatar
Non-Human User
Joined: 09 Sep 2013
Posts: 32678
Own Kudos [?]: 822 [0]
Given Kudos: 0
Send PM
Re: Does the prime number p divide n!? [#permalink]
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
Re: Does the prime number p divide n!? [#permalink]
Moderator:
Math Expert
92929 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne