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.

Selecting a committee of n people

Expert replies
by vishal.pathak » Wed Nov 23, 2011 4:32 am
Company X has n regional offices, where n represents an even integer. Each regional office must recommend two candidates, one male and one female, to serve on the corporate auditing committee. If each of the offices must be represented by exactly one member on the auditing committee and if the committee must consist of an equal number of male and female employees, how many different committees can be formed?
[spoiler]Soln. ( n!^2 )/ [ (n/2)!^4 ].
Company has n offices and from each office one male and one female will be recommended. Hence there will be n males and n females who will be recommended.
Each office must be represented by exactly one member which implies that totally only n people will be elected to the committee.
Also, there must be equal number of men and women which means that there must be n/2 men and n/2 women.
So out of n men, n/2 should be selected
and out of n women, n/2 should be selected.
Total ways of doing that
nC(n/2) x nC(n/2) = ( n!^2 )/ [ (n/2)!^4 ].

I have a doubt in this solution. When we do nC(n/2) x nC(n/2), are we not counting the ways in which we select both the man and the woman of the same regional office in the committee. Consider a regional office A. When we do nC(n/2) for n, we are randomly selecting people from the set of n and there will be a number of cases in which the guy from office A is slected. The same is true for the girl of office A. So when we do nC(n/2) x nC(n/2), will there not be a committee which will have both the guy and the girl of office A [/spoiler]
Join the discussion
Source: — Problem Solving |

by user123321 » Wed Nov 23, 2011 5:36 am
i am not so sure about this solution...this solution i think is not proper.
IMO it should be nC(n/2) = n!/(0.5n!)^2.

if we select half of the team teams and put men there, then it will give the combinations we need.

user123321
Just started my preparation :D
Want to do it right the first time.
Join the discussion

by vishal.pathak » Wed Nov 23, 2011 7:13 am
user123321 wrote:i am not so sure about this solution...this solution i think is not proper.
IMO it should be nC(n/2) = n!/(0.5n!)^2.

if we select half of the team teams and put men there, then it will give the combinations we need.

user123321
I dont believe this to be correct,buddy.We have to select n out of 2n and not n/2 out of n

Any other thoughts will be welcome
Join the discussion

by user123321 » Wed Nov 23, 2011 7:40 am
if you select n out of 2n you wont get sets with equal number of men and women.
instead, select half of teams and take a man from them & from remaining teams, take a woman. then it will solve the problem.

user123321
Just started my preparation :D
Want to do it right the first time.
Join the discussion

by Ian Stewart » Wed Nov 23, 2011 7:48 am
vishal.pathak wrote:Company X has n regional offices, where n represents an even integer. Each regional office must recommend two candidates, one male and one female, to serve on the corporate auditing committee. If each of the offices must be represented by exactly one member on the auditing committee and if the committee must consist of an equal number of male and female employees, how many different committees can be formed?
Soln. ( n!^2 )/ [ (n/2)!^4 ].
Company has n offices and from each office one male and one female will be recommended. Hence there will be n males and n females who will be recommended.
Each office must be represented by exactly one member which implies that totally only n people will be elected to the committee.
Also, there must be equal number of men and women which means that there must be n/2 men and n/2 women.
So out of n men, n/2 should be selected
and out of n women, n/2 should be selected.
Total ways of doing that
nC(n/2) x nC(n/2) = ( n!^2 )/ [ (n/2)!^4 ].

I have a doubt in this solution. When we do nC(n/2) x nC(n/2), are we not counting the ways in which we select both the man and the woman of the same regional office in the committee. Consider a regional office A. When we do nC(n/2) for n, we are randomly selecting people from the set of n and there will be a number of cases in which the guy from office A is slected. The same is true for the girl of office A. So when we do nC(n/2) x nC(n/2), will there not be a committee which will have both the guy and the girl of office A
You're right - that solution is completely wrong, since it ignores the fact that we must choose one person from each office. Where is it from?

To pick a committee consisting of n/2 men and n/2 women, we just need to choose which half of the offices will contribute a woman to the committee; then the remaining offices will each be forced to contribute a man to the committee. From the n offices available, we can choose the n/2 offices who will send a woman to the committee in (n)C(n/2) ways, so that's the answer.
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 knight247 » Wed Nov 23, 2011 8:21 am
deleted
Join the discussion