BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach Starts Oct 17
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Chris Peckover, 100th-Percentile GMAT Scorer

Oct 17 · Chris Peckover
Sat · 11:00 AM to 2:00 PM ET
Oct 20 · Chris Peckover
Tue, Thu · 8:00 to 10:00 PM ET
Oct 25 · Josh Braslow
Sun · 1:00 to 4:00 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemand 5 seats left Start anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

165+ EA score guarantee
$05-day trial no automatic billing
Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

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

Expert replies
by M7MBA » Fri Mar 16, 2018 4:14 am
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.
Join the discussion
Source: — Data Sufficiency |

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
Join the discussion

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.
Join the discussion