In how many ways can N students be seated in a row with

This topic has expert replies
Moderator
Posts: 2058
Joined: Sun Oct 29, 2017 4:24 am
Thanked: 1 times
Followed by:5 members
In how many ways can N students be seated in a row with N seats?

(1) |N − 6| = 3
(2) N^2 = 7N + 18

The OA is the option B.

I didn't understand this DS question. Can any expert clarify this for me? Thanks in advanced.

User avatar
GMAT Instructor
Posts: 15539
Joined: Tue May 25, 2010 12:04 pm
Location: New York, NY
Thanked: 13060 times
Followed by:1906 members
GMAT Score:790

by GMATGuruNY » Fri Mar 16, 2018 4:55 am
M7MBA wrote:In how many ways can N students be seated in a row with N seats?

(1) |N − 6| = 3
(2) N^2 = 7N + 18
The number of ways to arrange N students = N!.
Thus, to answer the question stem, we need to know the value of N.
Question stem, rephrased:
What is the value of N?

Statement 1:
If N-6 = 3, then N=9.
If N-6 = -3, then N=3.
Since N can be different values, INSUFFICIENT.

Statement 2:
N² - 7N - 18 = 0
(N-9)(N+2) = 0
N=9 or N=-2.
Since the number of students must be POSITIVE, only N=9 is viable.
SUFFICIENT.

The correct answer is B.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3

Legendary Member
Posts: 2898
Joined: Thu Sep 07, 2017 2:49 pm
Thanked: 6 times
Followed by:5 members

by Vincen » Fri Mar 16, 2018 6:12 am
Hello.

Since there are N students and N seats in a row, the number of way to organize them is N!

Now, the question is, what is N?

Using statement (1) we get that N=3 or N=9. Since 3! and 9! are different, this statement is not sufficient.

Using the statement (2) we get: $$N^2=7N+18\ \Rightarrow\ \ N^2-7N-18=0\ \Rightarrow\ \ \ \left(N-9\right)\left(N+2\right)=0$$ This give us two values of N, but one of hem is negative (N=-2) which is not possible.

Hence, we get only one solution N=9. Therefore, there are 9! ways to seat the 9 students. SUFFICIENT.

Thus, the answer is B.