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

 It is currently 14 Nov 2018, 05:38

### 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 November
PrevNext
SuMoTuWeThFrSa
28293031123
45678910
11121314151617
18192021222324
2526272829301
Open Detailed Calendar
• ### Free GMAT Strategy Webinar

November 17, 2018

November 17, 2018

07:00 AM PST

09:00 AM PST

Nov. 17, 7 AM PST. Aiming to score 760+? Attend this FREE session to learn how to Define your GMAT Strategy, Create your Study Plan and Master the Core Skills to excel on the GMAT.

# Does the prime number p divide n!?

Author Message
TAGS:

### Hide Tags

Intern
Joined: 30 Sep 2010
Posts: 19
Does the prime number p divide n!?  [#permalink]

### Show Tags

20 Dec 2010, 09:10
1
12
00:00

Difficulty:

95% (hard)

Question Stats:

28% (02:09) correct 72% (01:59) wrong based on 169 sessions

### HideShow timer Statistics

Does the prime number p divide n!?

(1) Prime number p divides n! + (n+2)!.
(2) The prime number p divides (n+2)!/n!.
Math Expert
Joined: 02 Sep 2009
Posts: 50580

### Show Tags

20 Dec 2010, 10:30
3
4
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.

_________________
##### General Discussion
Director
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
Joined: 03 Feb 2011
Posts: 748

### Show Tags

15 Apr 2011, 21:15
Actually there is a pattern in divisibility. Let's say a+b is divisible by c then we are not sure if a is divisible by c. But if b is divisible by c then a is divisible by c. Hence combining 1) + 2) works. I don't have see a better to solve this in 60 secs. But will love to hear from others.

Posted from my mobile device
Manager
Joined: 24 Aug 2008
Posts: 165
Location: India
WE 1: 3.75 IT
WE 2: 1.0 IT

### Show Tags

15 Apr 2011, 23:13
Understood y Statement 1 and statement 2 are eliminated.
But didn't understood how Both statements are sufficient.
Anyone pls help.
_________________

Cheers,
Varun

If you like my post, give me KUDOS!!

Retired Moderator
Joined: 05 Jul 2006
Posts: 1726
Re: Does the prime number p divide n!?  [#permalink]

### Show Tags

08 Oct 2017, 03:50
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
Joined: 19 Aug 2016
Posts: 86
Re: Does the prime number p divide n!?  [#permalink]

### Show Tags

08 Oct 2017, 17:22
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: 1726
Re: Does the prime number p divide n!?  [#permalink]

### Show Tags

08 Oct 2017, 17:43
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
Joined: 19 Aug 2016
Posts: 86
Does the prime number p divide n!?  [#permalink]

### Show Tags

Updated on: 17 Oct 2017, 18:58
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.

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, 18:56.
Last edited by zanaik89 on 17 Oct 2017, 18:58, edited 1 time in total.
Math Expert
Joined: 02 Sep 2009
Posts: 50580
Re: Does the prime number p divide n!?  [#permalink]

### Show Tags

17 Oct 2017, 20:17
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.

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
Joined: 22 May 2017
Posts: 88
GMAT 1: 580 Q41 V29
GMAT 2: 580 Q43 V27
Does the prime number p divide n!?  [#permalink]

### Show Tags

Updated on: 22 Oct 2017, 11:05
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!

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

Originally posted by Adityagmatclub on 22 Oct 2017, 10:37.
Last edited by Adityagmatclub on 22 Oct 2017, 11:05, edited 1 time in total.
Retired Moderator
Joined: 05 Jul 2006
Posts: 1726
Re: Does the prime number p divide n!?  [#permalink]

### Show Tags

22 Oct 2017, 11:02
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
Re: Does the prime number p divide n!? &nbs [#permalink] 22 Oct 2017, 11:02
Display posts from previous: Sort by