It is currently 17 Dec 2017, 13:30

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 June
Open Detailed Calendar

Does the prime number p divide n!?

Author Message
TAGS:

Hide Tags

Intern
Joined: 30 Sep 2010
Posts: 19

Kudos [?]: 166 [1], given: 1

Does the prime number p divide n!? [#permalink]

Show Tags

20 Dec 2010, 09:10
1
KUDOS
12
This post was
BOOKMARKED
00:00

Difficulty:

95% (hard)

Question Stats:

31% (01:26) correct 69% (01:34) wrong based on 161 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!.
[Reveal] Spoiler: OA

Kudos [?]: 166 [1], given: 1

Math Expert
Joined: 02 Sep 2009
Posts: 42652

Kudos [?]: 135977 [3], given: 12719

Show Tags

20 Dec 2010, 10:30
3
KUDOS
Expert's post
4
This post was
BOOKMARKED
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.

_________________

Kudos [?]: 135977 [3], given: 12719

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: 865

Kudos [?]: 405 [0], given: 123

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

Kudos [?]: 405 [0], given: 123

Manager
Joined: 24 Aug 2008
Posts: 213

Kudos [?]: 84 [0], given: 5

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!!

Kudos [?]: 84 [0], given: 5

Retired Moderator
Joined: 05 Jul 2006
Posts: 1748

Kudos [?]: 448 [0], given: 49

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

Kudos [?]: 448 [0], given: 49

Manager
Joined: 19 Aug 2016
Posts: 64

Kudos [?]: 3 [0], given: 1

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

Kudos [?]: 3 [0], given: 1

Retired Moderator
Joined: 05 Jul 2006
Posts: 1748

Kudos [?]: 448 [0], given: 49

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

Kudos [?]: 448 [0], given: 49

Manager
Joined: 19 Aug 2016
Posts: 64

Kudos [?]: 3 [0], given: 1

Does the prime number p divide n!? [#permalink]

Show Tags

17 Oct 2017, 18:56
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]

Last edited by zanaik89 on 17 Oct 2017, 18:58, edited 1 time in total.

Kudos [?]: 3 [0], given: 1

Math Expert
Joined: 02 Sep 2009
Posts: 42652

Kudos [?]: 135977 [0], given: 12719

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!
_________________

Kudos [?]: 135977 [0], given: 12719

Manager
Joined: 22 May 2017
Posts: 90

Kudos [?]: 7 [0], given: 223

GMAT 1: 580 Q41 V29
GMAT 2: 580 Q43 V27
Does the prime number p divide n!? [#permalink]

Show Tags

22 Oct 2017, 10:37
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.

Last edited by Adityagmatclub on 22 Oct 2017, 11:05, edited 1 time in total.

Kudos [?]: 7 [0], given: 223

Retired Moderator
Joined: 05 Jul 2006
Posts: 1748

Kudos [?]: 448 [0], given: 49

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

Kudos [?]: 448 [0], given: 49

Re: Does the prime number p divide n!?   [#permalink] 22 Oct 2017, 11:02
Display posts from previous: Sort by