Last visit was: 20 Nov 2025, 06:27 It is currently 20 Nov 2025, 06:27
Home
GMAT
Messages
Tests
Schools
Events
Rewards
Chat
My Profile
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
Back to Forum
Create Topic
User avatar
surendar26
User avatar
Joined: 30 Sep 2010
Last visit: 28 Jan 2011
Posts: 15
Own Kudos:
696
 [15]
Given Kudos: 1
Posts: 15
Kudos: 696
 [15]
Does the prime number p divide n!? 20 Dec 2010, 10:10
1
Kudos
Add Kudos
14
Bookmarks
Bookmark this Post
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide
Show
History
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!

Difficulty:

95% (hard)

Question Stats:

30% (02:11) correct 70% (02:05) wrong based on 159 sessions

History

Date
Time
Result
Not Attempted Yet
Does the prime number p divide n!?

(1) Prime number p divides n! + (n+2)!.
(2) The prime number p divides (n+2)!/n!.
ShowHide Answer
Official Answer
C
Most Helpful Reply
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 20 Nov 2025
Posts: 105,416
Own Kudos:
778,505
 [8]
Given Kudos: 99,987
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,416
Kudos: 778,505
 [8]
Does the prime number p divide n!? 20 Dec 2010, 11:30
4
Kudos
Add Kudos
4
Bookmarks
Bookmark this Post
surendar26
Does the prime number p divide n!?

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

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.
General Discussion
User avatar
gmat1220
User avatar
Joined: 03 Feb 2011
Last visit: 17 Feb 2020
Posts: 466
Own Kudos:
987
 [1]
Given Kudos: 123
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
Products:
My Reviews
Posts: 466
Kudos: 987
 [1]
Does the prime number p divide n!? 15 Apr 2011, 22:15
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
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
User avatar
varunmaheshwari
User avatar
Joined: 25 Aug 2008
Last visit: 28 Jun 2012
Posts: 99
Own Kudos:
328
Given Kudos: 5
Location: India
WE 1: 3.75 IT
WE 2: 1.0 IT
Posts: 99
Kudos: 328
Does the prime number p divide n!? 16 Apr 2011, 00:13
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Understood y Statement 1 and statement 2 are eliminated.
But didn't understood how Both statements are sufficient.
Anyone pls help.
User avatar
yezz
User avatar
Retired Moderator
Joined: 05 Jul 2006
Last visit: 26 Apr 2022
Posts: 833
Own Kudos:
1,661
Given Kudos: 49
Posts: 833
Kudos: 1,661
Does the prime number p divide n!? 08 Oct 2017, 04:50
Kudos
Add Kudos
Bookmarks
Bookmark this Post
surendar26
Does the prime number p divide n!?

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

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
avatar
zanaik89
avatar
Joined: 19 Aug 2016
Last visit: 29 Nov 2019
Posts: 54
Own Kudos:
8
Given Kudos: 30
Posts: 54
Kudos: 8
Does the prime number p divide n!? 08 Oct 2017, 18:22
Kudos
Add Kudos
Bookmarks
Bookmark this Post
yezz
surendar26
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
Show more

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

Thanks
User avatar
yezz
User avatar
Retired Moderator
Joined: 05 Jul 2006
Last visit: 26 Apr 2022
Posts: 833
Own Kudos:
1,661
Given Kudos: 49
Posts: 833
Kudos: 1,661
Does the prime number p divide n!? 08 Oct 2017, 18:43
Kudos
Add Kudos
Bookmarks
Bookmark this Post
zanaik89
yezz
surendar26
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
Show more

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
avatar
zanaik89
avatar
Joined: 19 Aug 2016
Last visit: 29 Nov 2019
Posts: 54
Own Kudos:
8
Given Kudos: 30
Posts: 54
Kudos: 8
Does the prime number p divide n!? Updated on: 17 Oct 2017, 19:58
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.
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
surendar26
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.
Show more

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]
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 20 Nov 2025
Posts: 105,416
Own Kudos:
778,505
Given Kudos: 99,987
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,416
Kudos: 778,505
Does the prime number p divide n!? 17 Oct 2017, 21:17
Kudos
Add Kudos
Bookmarks
Bookmark this Post
zanaik89
Bunuel
surendar26
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]
Show more

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!
User avatar
Adityagmatclub
User avatar
Joined: 22 May 2017
Last visit: 13 Feb 2024
Posts: 70
Own Kudos:
18
Given Kudos: 223
Posts: 70
Kudos: 18
Does the prime number p divide n!? Updated on: 22 Oct 2017, 12:05
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.
Kudos
Add Kudos
Bookmarks
Bookmark this Post
yezz
surendar26
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
Show more

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.
User avatar
yezz
User avatar
Retired Moderator
Joined: 05 Jul 2006
Last visit: 26 Apr 2022
Posts: 833
Own Kudos:
1,661
Given Kudos: 49
Posts: 833
Kudos: 1,661
Does the prime number p divide n!? 22 Oct 2017, 12:02
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,598
Own Kudos:
1,079
Posts: 38,598
Kudos: 1,079
Does the prime number p divide n!? 15 May 2025, 00:04
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.
Moderators:
Bunuel
Math Expert
105416 posts
kingbucky
496 posts