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

 It is currently 15 Dec 2018, 19:44

### 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 December
PrevNext
SuMoTuWeThFrSa
2526272829301
2345678
9101112131415
16171819202122
23242526272829
303112345
Open Detailed Calendar
• ### $450 Tuition Credit & Official CAT Packs FREE December 15, 2018 December 15, 2018 10:00 PM PST 11:00 PM PST Get the complete Official GMAT Exam Pack collection worth$100 with the 3 Month Pack ($299) • ### FREE Quant Workshop by e-GMAT! December 16, 2018 December 16, 2018 07:00 AM PST 09:00 AM PST Get personalized insights on how to achieve your Target Quant Score. # Suppose n children are going to sit, in any order, on a row of n chair  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics Author Message TAGS: ### Hide Tags Math Expert Joined: 02 Sep 2009 Posts: 51218 Suppose n children are going to sit, in any order, on a row of n chair [#permalink] ### Show Tags 23 Feb 2015, 02:24 6 10 00:00 Difficulty: 25% (medium) Question Stats: 71% (01:14) correct 29% (01:25) wrong based on 682 sessions ### HideShow timer Statistics Suppose n children are going to sit, in any order, on a row of n chairs. What is the value of n? (1) In this row, there are 5040 possible arrangements of the n children. (2) If one child leaves, and one chair is removed from the row, there would be 4320 fewer arrangements of the remaining children. Kudos for a correct solution. _________________ ##### Most Helpful Expert Reply Math Expert Joined: 02 Sep 2009 Posts: 51218 Re: Suppose n children are going to sit, in any order, on a row of n chair [#permalink] ### Show Tags 02 Mar 2015, 05:51 5 4 Bunuel wrote: Suppose n children are going to sit, in any order, on a row of n chairs. What is the value of n? (1) In this row, there are 5040 possible arrangements of the n children. (2) If one child leaves, and one chair is removed from the row, there would be 4320 fewer arrangements of the remaining children. Kudos for a correct solution. MAGOOSH OFFICIAL SOLUTION: This is a question about permutations. Because this is Data Sufficiency, we don’t have to bother with the details of calculating n! —- it’s enough to know that if we know the value of n, we can figure out the value of n!, and vice versa! Statement #1: this gives us n! = 5040 — from this we could figure out n. Statement #1, alone and by itself, is sufficient. Statement #2: this tells us, essentially, n! – (n – 1)! = 4320. Well, if we went through list of factorials, there could be only one pair that is separated by exactly 4320. We don’t have to know what it is — it’s enough to know that this fact determines a unique value of n. Statement #2, alone and by itself, is sufficient. Answer = D. (BTW, n = 7 if you’re curious!) _________________ ##### General Discussion Manager Status: single Joined: 19 Jan 2015 Posts: 87 Location: India GPA: 3.2 WE: Sales (Pharmaceuticals and Biotech) Re: Suppose n children are going to sit, in any order, on a row of n chair [#permalink] ### Show Tags 23 Feb 2015, 02:40 1 statement 1 If n children sits in nchairs then arrangements is n! Total arrangements is 5040. it equals to 7!. It is sufficient. Statement 2 By removing one children from n is( n-1) and one chair from n row is( n-1) than arrangements is n! - (n-1)!. Arrangement is 4320 left. it means 7! - 6!. 5040 - 720= 4320. It is also sufficient. so answer is D EMPOWERgmat Instructor Status: GMAT Assassin/Co-Founder Affiliations: EMPOWERgmat Joined: 19 Dec 2014 Posts: 13095 Location: United States (CA) GMAT 1: 800 Q51 V49 GRE 1: Q170 V170 Re: Suppose n children are going to sit, in any order, on a row of n chair [#permalink] ### Show Tags 04 Mar 2015, 22:56 Hi All, There are going to be a few questions on Test Day that require the use of factorials. While it's not necessary to have these calculations memorized, if you DO have them memorized, then you'll likely be able to move much faster on these handful of questions. 2! = 2 3! = 6 4! = 24 5! = 120 6! = 720 7! = 5040 You're not likely to have to deal with much higher than 7! as a 'solo' calculation. In a question such as this one, this knowledge can help you to quickly work through the prompt. GMAT assassins aren't born, they're made, Rich _________________ 760+: Learn What GMAT Assassins Do to Score at the Highest Levels Contact Rich at: Rich.C@empowergmat.com # Rich Cohen Co-Founder & GMAT Assassin Special Offer: Save$75 + GMAT Club Tests Free
Official GMAT Exam Packs + 70 Pt. Improvement Guarantee
www.empowergmat.com/

*****Select EMPOWERgmat Courses now include ALL 6 Official GMAC CATs!*****

Manager
Joined: 13 Mar 2013
Posts: 163
Location: United States
GPA: 3.5
WE: Engineering (Telecommunications)
Re: Suppose n children are going to sit, in any order, on a row of n chair  [#permalink]

### Show Tags

10 Sep 2015, 06:17
Suppose n children are going to sit, in any order, on a row of n chairs. What is the value of n?

(1) In this row, there are 5040 possible arrangements of the n children.
(2) If one child leaves, and one chair is removed from the row, there would be 4320 fewer arrangements of the remaining children.

Statement 1 . Sufficient
because n children can be arranged in n chairs in n! ( n factorials ways )
and 7! =5040

Statement : 2 Sufficient
Because 7! = 5040
and if we remove one person and one chair then there would be 4320 scenario .

6!=720
7! - 6! = 4320
_________________

Regards ,

Intern
Joined: 26 Jan 2017
Posts: 6
Re: Suppose n children are going to sit, in any order, on a row of n chair  [#permalink]

### Show Tags

17 May 2017, 09:24
Sorry if I'm asking naive questions but all of the above members have no difficulties in pointing out that 7! = 5040, so that they could easily reach the answer.

To me, 5040 seems alien. I can't tell 5040 is a factorial at a glance.

Okay, I see someone recommending that it is useful to memorize the factorials from 1! to 7!. That may be the method to solve this particular question.

But what if the question gives random numbers, which we don't know for sure if they are factorials or not? For example, statement (1): n! = 12345, statement (2): n! - (n-1)! = 1234.

Thanks for any help,
EMPOWERgmat Instructor
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 13095
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Re: Suppose n children are going to sit, in any order, on a row of n chair  [#permalink]

### Show Tags

17 May 2017, 12:18
2
mynguyen62 wrote:
Sorry if I'm asking naive questions but all of the above members have no difficulties in pointing out that 7! = 5040, so that they could easily reach the answer.

To me, 5040 seems alien. I can't tell 5040 is a factorial at a glance.

Okay, I see someone recommending that it is useful to memorize the factorials from 1! to 7!. That may be the method to solve this particular question.

But what if the question gives random numbers, which we don't know for sure if they are factorials or not? For example, statement (1): n! = 12345, statement (2): n! - (n-1)! = 1234.

Thanks for any help,

Hi mynguyen62,

As a subject, factorials are relatively rare on the GMAT (you'll likely see just one question on the subject on Test Day). That having been said, nothing about factorials is "random", so there cannot be a Quant question involving factorials that uses random numbers. As such, if you're told that N! = a specific number, then there is just ONE possible value for N (and the same can be said for the difference between two Factorials). Knowing that 7! = 5040 might make it easier to 'process' the information in this question, but it's not necessary to know that IF you realize that a different "N" leads to a different/unique result for N!

GMAT assassins aren't born, they're made,
Rich
_________________

760+: Learn What GMAT Assassins Do to Score at the Highest Levels
Contact Rich at: Rich.C@empowergmat.com

# Rich Cohen

Co-Founder & GMAT Assassin

Special Offer: Save \$75 + GMAT Club Tests Free
Official GMAT Exam Packs + 70 Pt. Improvement Guarantee
www.empowergmat.com/

*****Select EMPOWERgmat Courses now include ALL 6 Official GMAC CATs!*****

Intern
Joined: 07 Jan 2017
Posts: 19
Location: India
Concentration: Other, Other
Schools: UConn"19
WE: Medicine and Health (Pharmaceuticals and Biotech)
Re: Suppose n children are going to sit, in any order, on a row of n chair  [#permalink]

### Show Tags

14 Jun 2017, 12:30
1
Statement 1 . Sufficient
there are 5040 possible arrangements of the n children And because n children can be arranged in n chairs in n!
thus n!=5040
Using prime factorisation I found n=7

Statement : 2 Sufficient
and if we remove one person and one chair then there would be 4320 scenario
n!-(n- 1)!=4320
Taking (n-1) common , (n-1).(n-1)!=4320
Using prime factorisation u can find (n-1) to be 6
6*6! = 4320

And D
Senior DS Moderator
Joined: 27 Oct 2017
Posts: 1137
Location: India
GPA: 3.64
WE: Business Development (Energy and Utilities)
Re: Suppose n children are going to sit, in any order, on a row of n chair  [#permalink]

### Show Tags

14 May 2018, 06:17
Bunuel, chetan2u, EMPOWERgmatRichC, VeritasPrepKarishma

if $$n!-(n-1)!$$ = K (a constant integer)

Can the value of n be uniquely determined ?
_________________
Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 8678
Location: Pune, India
Re: Suppose n children are going to sit, in any order, on a row of n chair  [#permalink]

### Show Tags

14 May 2018, 08:33
1
gmatbusters wrote:
Bunuel, chetan2u, EMPOWERgmatRichC, VeritasPrepKarishma

if $$n!-(n-1)!$$ = K (a constant integer)

Can the value of n be uniquely determined ?

Note the pattern:
0! = 1
1! = 1
2! = 2
3! = 6
4! = 24
5! = 120
6! = 720

The difference between consecutive factorials keeps increasing (obviously since every time you are multiplying it by the next greater number).
So there will be only one pair of consecutive values for any given constant.

Say K = 18. Then n = 4
Say K = 600. Then n = 6
and so on...
_________________

Karishma
Veritas Prep GMAT Instructor

Senior DS Moderator
Joined: 27 Oct 2017
Posts: 1137
Location: India
GPA: 3.64
WE: Business Development (Energy and Utilities)
Re: Suppose n children are going to sit, in any order, on a row of n chair  [#permalink]

### Show Tags

14 May 2018, 09:02
1
Thank you for giving insights...

VeritasPrepKarishma wrote:

if $$n!-(n-1)!$$ = K (a constant integer)

Can the value of n be uniquely determined ?

Note the pattern:
0! = 1
1! = 1
2! = 2
3! = 6
4! = 24
5! = 120
6! = 720

The difference between consecutive factorials keeps increasing (obviously since every time you are multiplying it by the next greater number).
So there will be only one pair of consecutive values for any given constant.

Say K = 18. Then n = 4
Say K = 600. Then n = 6
and so on...[/quote]
_________________
Manager
Joined: 29 Sep 2017
Posts: 113
Location: United States
GMAT 1: 720 Q49 V39
GPA: 3.3
WE: Consulting (Consulting)
Re: Suppose n children are going to sit, in any order, on a row of n chair  [#permalink]

### Show Tags

14 May 2018, 13:21
1
Suppose n children are going to sit, in any order, on a row of n chairs. What is the value of n?

(1) In this row, there are 5040 possible arrangements of the n children.
(2) If one child leaves, and one chair is removed from the row, there would be 4320 fewer arrangements of the remaining children.

1) Would GMAT give 5041 as an answer? Nope, never seen it. Given it's a straight number, this will be sufficient.
2) Same logic applies. Would the difference of n! - (n-1)! be some random number? Nope; thus, this will be sufficient.

Without solving, I would wager on D.
_________________

If this helped, please give kudos!

Intern
Joined: 14 May 2018
Posts: 3
Schools: Stern '21 (A)
Re: Suppose n children are going to sit, in any order, on a row of n chair  [#permalink]

### Show Tags

14 May 2018, 13:30
Explain u posted is helpful ! but do not understand why B can be right ? How can u calculate on exam with no calc?
Senior DS Moderator
Joined: 27 Oct 2017
Posts: 1137
Location: India
GPA: 3.64
WE: Business Development (Energy and Utilities)
Re: Suppose n children are going to sit, in any order, on a row of n chair  [#permalink]

### Show Tags

14 May 2018, 17:17
BeePen, please see the below explanation by veritasprepkarishma

if $$n!-(n-1)!$$ = K (a constant integer), n can be uniquely found

Note the pattern:
0! = 1
1! = 1
2! = 2
3! = 6
4! = 24
5! = 120
6! = 720

The difference between consecutive factorials keeps increasing (obviously since every time you are multiplying it by the next greater number).

So there will be only one pair of consecutive values for any given constant.

Say K = 18. Then n = 4
Say K = 600. Then n = 6
and so on...[/quote]
_________________
Study Buddy Forum Moderator
Joined: 04 Sep 2016
Posts: 1269
Location: India
WE: Engineering (Other)
Re: Suppose n children are going to sit, in any order, on a row of n chair  [#permalink]

### Show Tags

17 Jul 2018, 23:01
Bunuel niks18 chetan2u pushpitkc

Quote:
Suppose n children are going to sit, in any order, on a row of n chairs. What is the value of n?

(2) If one child leaves, and one chair is removed from the row, there would be 4320 fewer arrangements of the remaining children.

Can you please explain St 2: How we interpret : n! – (n – 1)! = 4320
when we have same no of children and chair and start and now we removed each of one chair and one children.
_________________

It's the journey that brings us happiness not the destination.

Senior PS Moderator
Joined: 26 Feb 2016
Posts: 3325
Location: India
GPA: 3.12
Re: Suppose n children are going to sit, in any order, on a row of n chair  [#permalink]

### Show Tags

18 Jul 2018, 02:14
1
Bunuel niks18 chetan2u pushpitkc

Quote:
Suppose n children are going to sit, in any order, on a row of n chairs. What is the value of n?

(2) If one child leaves, and one chair is removed from the row, there would be 4320 fewer arrangements of the remaining children.

Can you please explain St 2: How we interpret: n! – (n – 1)! = 4320
when we have same no of children and chair and start and now we removed each of one chair and one children.

The 'n' children can be arranged in 'n' chairs is n! ways
After 1 chair is removed, the 'n-1' children can be arranged in (n-1)! ways

Statement 2 says that if one child leaves and one chair is removed

To understand this clearly, let's consider n = 3.

So, how can we seat 3 children in 3 chairs -
3 ways of seating one of the 3 children in the first chair
2 ways of seating one of the 2 children in the second chair
1 ways of seating one child in the third chair (3*2*1), which is 3!

Similarly, we can seat 2 children in 2 chairs as (2*1), which is 2!

Therefore, the total number of ways must be n! - (n-1)!

Hope this helps you!
_________________

You've got what it takes, but it will take everything you've got

Re: Suppose n children are going to sit, in any order, on a row of n chair &nbs [#permalink] 18 Jul 2018, 02:14
Display posts from previous: Sort by