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 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

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
Limited cohort · enrollment openTarget 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.

The number of ways of arranging n students

Expert replies
by talaangoshtari » Wed Jul 01, 2015 10:43 am
The number of ways of arranging n students in a row such that no two boys sit together and no two girls sit together is m(m > 100). If one more student is added, then number of ways of arranging as above increases by 200%. The value of n is

A. 12

B. 8

C. 9

D. 10

E. 13
Join the discussion
Source: — Problem Solving |

by Ian Stewart » Wed Jul 01, 2015 2:48 pm
If we increase something by 200%, we are multiplying it by 3.

There is a conceptual solution here, but it's more complicated than backsolving, so let's just test answers. If you have, say, 10 students, 5 boys and 5 girls, there will be two ways to arrange them:

BGBGBGBGBG

or

GBGBGBGBGB

In the first case, you'd have 5 choices for the first boy, 5 for the first girl, 4 for the second boy, 4 for the second girl, and so on. So you'd have 5! * 5! arrangements in total. The same is true in the second case, so we can arrange the students in 5!*5! + 5!*5! = 2*5!*5! ways. From here you can see how to count arrangements for any even number of students - if we had, say, 12 students, the answer would be 2*6!*6!

When we have an odd number of students, so say we have 6 boys and 5 girls, then we must put boys at each end of the arrangement, so it must look like:

BGBGBGBGBG

and we find we have 6!*5! arrangements in total. From here you can see how to count whenever n is odd; with 13 students, say, the answer would be 7! * 6!

So it's possible to work out fairly quickly the number of arrangements for any value of n. Notice that when n is 10, we have 2*5!*5! arrangements, and when n=11, we have 6!*5! = 6*5!*5! arrangements. Since 6*5!*5! is exactly 3 times 2*5!*5!, the answer is 10.

The question is too long to be a realistic GMAT problem though.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com

ianstewartgmat.com
Join the discussion

by talaangoshtari » Wed Jul 01, 2015 10:18 pm
When should we use nCr in solving this kind of problem?
For example,
In how many ways can 4 ladies and 5 gentlemen be seated in a row so that no two ladies sit together?

(5!)(4!)6C4

When we have 6 boys and 5 girls, why (5!)(6!)6C5 is wrong?
Join the discussion

by nikhilgmat31 » Fri Jul 03, 2015 2:44 am
Please provide a simple solution to this problem.
Join the discussion