Last visit was: 19 Nov 2025, 02:17 It is currently 19 Nov 2025, 02:17
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
User avatar
tarek99
User avatar
Joined: 21 Jul 2006
Last visit: 14 Nov 2025
Posts: 768
Own Kudos:
5,040
Given Kudos: 1
Posts: 768
Kudos: 5,040
What is the positive integer n ? (1) For every positive Updated on: 21 Sep 2008, 14:40
Originally posted by tarek99 on 21 Sep 2008, 09:21.
Last edited by tarek99 on 21 Sep 2008, 14:40, edited 1 time in total.
Kudos
Add Kudos
Bookmarks
Bookmark this Post
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide
Show
History
N
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

History

Date
Time
Result
Not Attempted Yet
What is the positive integer \(n\)?

(1) For every positive integer \(m\), \((m+n)!/(m-1)!\) is divisible by \(16\)

(2) \(n^2 - 9n + 20 = 0\)



Please explain your answer because I couldn't even understand how to approach this problem.



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
User avatar
IgnitedMind
User avatar
Joined: 28 Aug 2008
Last visit: 10 Mar 2009
Posts: 53
Own Kudos:
217
Posts: 53
Kudos: 217
What is the positive integer n ? (1) For every positive 21 Sep 2008, 09:30
Kudos
Add Kudos
Bookmarks
Bookmark this Post
IMO .... E

1) INSF , m and n can be many different numbers that could be multiple of 16

2) INSF, (n-5)(n-4) - n could be 5 or 4

Together - INSF - Sat m =2, plug 5 or 4 into equation and both yield integers


INSF... answer E
User avatar
zonk
User avatar
Current Student
Joined: 12 Jul 2008
Last visit: 10 Nov 2013
Posts: 366
Own Kudos:
351
Concentration: Finance, Entrepreneurship, Health Care
Schools:Wharton
Posts: 366
Kudos: 351
What is the positive integer n ? (1) For every positive 21 Sep 2008, 10:08
Kudos
Add Kudos
Bookmarks
Bookmark this Post
tarek99
What is the positive integer \(n\)?

(1) For every integer \(m\), \((m+n)!/(m-1)!\) is divisible by \(16\)

(2) \(n^2 - 9n + 20 = 0\)



Please explain your answer because I couldn't even understand how to approach this problem.
Show more

(1) Insufficient

\((m+n)!/(m-1)! = (m+n)*(m+n-1)*(m+n-2)*...*m\)

This expression is divisible by \(2^4\), meaning that when you prime factorize the expression, 2 is a factor at least 4 times.
This is the case for many values of m and n.

(2) Insufficient

\(n^2 - 9n + 20 = 0\)

\((n-5)(n-4) = 0\)

\(n = 5 or 4\)

(1) and (2) Insufficient
For n=5 or n=4, there are values of m that would allow \((m+n)!/(m-1)!\) to be divisible by 16.
User avatar
IanStewart
User avatar
GMAT Tutor
Joined: 24 Jun 2008
Last visit: 18 Nov 2025
Posts: 4,145
Own Kudos:
10,986
 [1]
Given Kudos: 99
Expert
Expert reply
Posts: 4,145
Kudos: 10,986
 [1]
What is the positive integer n ? (1) For every positive 21 Sep 2008, 10:17
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
The question should surely read "For every positive integer m..."; you aren't expected to know what it means to take the factorial of a negative number on the GMAT. With that adjustment the answer is C. The key is in analyzing the first statement:

(m+n)!/(m-1)! is just the product of the integers between m and m+n (that is, (m+n)!/(m-1)! = m*(m+1)*...*(m+n)). So it's just the product of n+1 consecutive integers. If you ever take the product of six or more consecutive integers, the product will be divisible by 16 because at least three of the numbers will be even (divisible by 2), and at least one will be divisible by 4. In fact, the product of six consecutive integers will always be divisible by 6!, but we don't need that here. However, the product of five consecutive integers will not always be divisible by 16- take 1,2,3,4,5 for example. So Statement 1 guarantees that n is at least 5. From Statement 2, we have that n can only be 4 or 5, so together the statements are sufficient.
User avatar
GMBA85
User avatar
Joined: 03 Jun 2008
Last visit: 09 Aug 2009
Posts: 61
Own Kudos:
429
Concentration: Finance
Schools:ISB, Tuck, Michigan (Ross), Darden, MBS
Posts: 61
Kudos: 429
What is the positive integer n ? (1) For every positive 21 Sep 2008, 10:25
Kudos
Add Kudos
Bookmarks
Bookmark this Post
IanStewart
The question should surely read "For every positive integer m..."; you aren't expected to know what it means to take the factorial of a negative number on the GMAT. With that adjustment the answer is C. The key is in analyzing the first statement:

(m+n)!/(m-1)! is just the product of the integers between m and m+n (that is, (m+n)!/(m-1)! = m*(m+1)*...*(m+n)). So it's just the product of n+1 consecutive integers. If you ever take the product of six or more consecutive integers, the product will be divisible by 16 because at least three of the numbers will be even (divisible by 2), and at least one will be divisible by 4. In fact, the product of six consecutive integers will always be divisible by 6!, but we don't need that here. However, the product of five consecutive integers will not always be divisible by 16- take 1,2,3,4,5 for example. So Statement 1 guarantees that n is at least 5. From Statement 2, we have that n can only be 4 or 5, so together the statements are sufficient.
Show more


nicely explained

+1

u deserve the highest kudos: posts ratio!
User avatar
FN
User avatar
Current Student
Joined: 28 Dec 2004
Last visit: 07 May 2012
Posts: 1,576
Own Kudos:
675
Given Kudos: 2
Location: New York City
Concentration: Social Enterprise
Schools:Wharton'11 HBS'12
Posts: 1,576
Kudos: 675
What is the positive integer n ? (1) For every positive 21 Sep 2008, 10:57
Kudos
Add Kudos
Bookmarks
Bookmark this Post
i believe factorials only exist for positive numbers..

having said that worst case scenario is that m=1

in that case..n has to be 5..or greater ..cause we dont have enough even numbers..

therefore i will go with C..
User avatar
zonk
User avatar
Current Student
Joined: 12 Jul 2008
Last visit: 10 Nov 2013
Posts: 366
Own Kudos:
351
Concentration: Finance, Entrepreneurship, Health Care
Schools:Wharton
Posts: 366
Kudos: 351
What is the positive integer n ? (1) For every positive 21 Sep 2008, 12:40
Kudos
Add Kudos
Bookmarks
Bookmark this Post
IanStewart
The question should surely read "For every positive integer m..."; you aren't expected to know what it means to take the factorial of a negative number on the GMAT. With that adjustment the answer is C. The key is in analyzing the first statement:

(m+n)!/(m-1)! is just the product of the integers between m and m+n (that is, (m+n)!/(m-1)! = m*(m+1)*...*(m+n)). So it's just the product of n+1 consecutive integers. If you ever take the product of six or more consecutive integers, the product will be divisible by 16 because at least three of the numbers will be even (divisible by 2), and at least one will be divisible by 4. In fact, the product of six consecutive integers will always be divisible by 6!, but we don't need that here. However, the product of five consecutive integers will not always be divisible by 16- take 1,2,3,4,5 for example. So Statement 1 guarantees that n is at least 5. From Statement 2, we have that n can only be 4 or 5, so together the statements are sufficient.
Show more

Agree, Ian. That'll teach me to pay attention!
User avatar
tarek99
User avatar
Joined: 21 Jul 2006
Last visit: 14 Nov 2025
Posts: 768
Own Kudos:
5,040
Given Kudos: 1
Posts: 768
Kudos: 5,040
What is the positive integer n ? (1) For every positive 21 Sep 2008, 14:33
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Well, the OA is C. Also, the question doesn't mention whether m is positive. I just double checked with the question and it's correct the way it is. I got this from a pdf file, so i'm not sure how completely correct is the question, but this is what it says at least.
User avatar
tarek99
User avatar
Joined: 21 Jul 2006
Last visit: 14 Nov 2025
Posts: 768
Own Kudos:
5,040
Given Kudos: 1
Posts: 768
Kudos: 5,040
What is the positive integer n ? (1) For every positive 21 Sep 2008, 14:56
Kudos
Add Kudos
Bookmarks
Bookmark this Post
IanStewart
The question should surely read "For every positive integer m..."; you aren't expected to know what it means to take the factorial of a negative number on the GMAT. With that adjustment the answer is C. The key is in analyzing the first statement:

(m+n)!/(m-1)! is just the product of the integers between m and m+n (that is, (m+n)!/(m-1)! = m*(m+1)*...*(m+n)). So it's just the product of n+1 consecutive integers. If you ever take the product of six or more consecutive integers, the product will be divisible by 16 because at least three of the numbers will be even (divisible by 2), and at least one will be divisible by 4. In fact, the product of six consecutive integers will always be divisible by 6!, but we don't need that here. However, the product of five consecutive integers will not always be divisible by 16- take 1,2,3,4,5 for example. So Statement 1 guarantees that n is at least 5. From Statement 2, we have that n can only be 4 or 5, so together the statements are sufficient.
Show more

that's a good explanation! +1

but what about (m-1)!? you avoided it in your explanation. Would you please explain how (m-1)! should be be handled?
thanks
User avatar
spriya
User avatar
Joined: 17 Jun 2008
Last visit: 18 Nov 2010
Posts: 617
Own Kudos:
3,059
Posts: 617
Kudos: 3,059
What is the positive integer n ? (1) For every positive 21 Sep 2008, 18:13
Kudos
Add Kudos
Bookmarks
Bookmark this Post
tarek99
IanStewart
The question should surely read "For every positive integer m..."; you aren't expected to know what it means to take the factorial of a negative number on the GMAT. With that adjustment the answer is C. The key is in analyzing the first statement:

(m+n)!/(m-1)! is just the product of the integers between m and m+n (that is, (m+n)!/(m-1)! = m*(m+1)*...*(m+n)). So it's just the product of n+1 consecutive integers. If you ever take the product of six or more consecutive integers, the product will be divisible by 16 because at least three of the numbers will be even (divisible by 2), and at least one will be divisible by 4. In fact, the product of six consecutive integers will always be divisible by 6!, but we don't need that here. However, the product of five consecutive integers will not always be divisible by 16- take 1,2,3,4,5 for example. So Statement 1 guarantees that n is at least 5. From Statement 2, we have that n can only be 4 or 5, so together the statements are sufficient.

that's a good explanation! +1

but what about (m-1)!? you avoided it in your explanation. Would you please explain how (m-1)! should be be handled?
thanks
Show more
Good explanation and good question!!!
User avatar
icandy
User avatar
Joined: 05 Jul 2008
Last visit: 15 Apr 2011
Posts: 621
Own Kudos:
2,157
Given Kudos: 1
Posts: 621
Kudos: 2,157
What is the positive integer n ? (1) For every positive 21 Sep 2008, 22:28
Kudos
Add Kudos
Bookmarks
Bookmark this Post
IanStewart
The question should surely read "For every positive integer m..."; you aren't expected to know what it means to take the factorial of a negative number on the GMAT. With that adjustment the answer is C. The key is in analyzing the first statement:

(m+n)!/(m-1)! is just the product of the integers between m and m+n (that is, (m+n)!/(m-1)! = m*(m+1)*...*(m+n)). So it's just the product of n+1 consecutive integers. If you ever take the product of six or more consecutive integers, the product will be divisible by 16 because at least three of the numbers will be even (divisible by 2), and at least one will be divisible by 4. In fact, the product of six consecutive integers will always be divisible by 6!, but we don't need that here. However, the product of five consecutive integers will not always be divisible by 16- take 1,2,3,4,5 for example. So Statement 1 guarantees that n is at least 5. From Statement 2, we have that n can only be 4 or 5, so together the statements are sufficient.
Show more

Lets say m=5 n=4

9!/4! = 9 X 8 X 7 X 6 X 5. this is divisible by 16 correct How can n not be 4?
User avatar
IanStewart
User avatar
GMAT Tutor
Joined: 24 Jun 2008
Last visit: 18 Nov 2025
Posts: 4,145
Own Kudos:
10,986
Given Kudos: 99
Expert
Expert reply
Posts: 4,145
Kudos: 10,986
What is the positive integer n ? (1) For every positive 22 Sep 2008, 11:38
Kudos
Add Kudos
Bookmarks
Bookmark this Post
icandy
IanStewart
The question should surely read "For every positive integer m..."; you aren't expected to know what it means to take the factorial of a negative number on the GMAT. With that adjustment the answer is C. The key is in analyzing the first statement:

(m+n)!/(m-1)! is just the product of the integers between m and m+n (that is, (m+n)!/(m-1)! = m*(m+1)*...*(m+n)). So it's just the product of n+1 consecutive integers. If you ever take the product of six or more consecutive integers, the product will be divisible by 16 because at least three of the numbers will be even (divisible by 2), and at least one will be divisible by 4. In fact, the product of six consecutive integers will always be divisible by 6!, but we don't need that here. However, the product of five consecutive integers will not always be divisible by 16- take 1,2,3,4,5 for example. So Statement 1 guarantees that n is at least 5. From Statement 2, we have that n can only be 4 or 5, so together the statements are sufficient.

Lets say m=5 n=4

9!/4! = 9 X 8 X 7 X 6 X 5. this is divisible by 16 correct How can n not be 4?
Show more

Statement 1 says that (m+n)!/(m-1)! is divisible by 16 for *every* positive integer m, not just for some particular value of m like m=5. Try m = 3, and you'll see why n cannot be 4.

Tarek, I'm not sure I understand your question about (m-1)!. In the fraction (m+n)!/(m-1)!, the (m-1)! cancels with much of (m+n)! to leave us with (m+n)*(m+n-1)*...*(m+1)*m. Hope that answers your question.



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
Moderators:
Bunuel
Math Expert
105379 posts
GMATBusters
GMAT Tutor
1924 posts