Arrangement PS

This topic has expert replies
Senior | Next Rank: 100 Posts
Posts: 84
Joined: Fri Jan 07, 2011 8:29 am
Thanked: 5 times
Followed by:1 members

Arrangement PS

by crimson2283 » Sat Mar 05, 2011 8:16 am
Ben needs to form a committee of 3 from a group of 8 engineers to study design improvements for a product. If two of the
engineers are too inexperienced to serve together on the committee, how many different committees can Ben form?

20
30
50
56
336

Form a committee of 3 from 8 - 8C3 = 56
Exclude groups that have 2 engineers together - If say 1,2 need to be excluded - (1,2,3), (1,2,4), (1,2,5), (1,2,6), (1,2,7), (1,2,8) - 6 - PART 2

56-6 = 50

Is there any formula for such problems, where you can compute part 2 with ease?
Since its a small group, its fairly easy to compute, but if its big, it gets difficult.

Anybody?

Legendary Member
Posts: 1578
Joined: Sun Dec 28, 2008 1:49 am
Thanked: 82 times
Followed by:9 members
GMAT Score:720

by maihuna » Sat Mar 05, 2011 8:38 am
Assuming the two incapable engg are tagged bb, the input is : xxxxxxbb

W/o any constraint : 8c3 = !8/!3*!5 = 8*7*6/3*2 = 56

Out of these combination where both b are there can be done in : 2b only one way, Out of 6x, one x in 6c1 = 6 ways

So reud no = 56-6 = 50
Charged up again to beat the beast :)

User avatar
Master | Next Rank: 500 Posts
Posts: 436
Joined: Tue Feb 08, 2011 3:07 am
Thanked: 72 times
Followed by:6 members

by manpsingh87 » Sat Mar 05, 2011 9:33 am
crimson2283 wrote:Ben needs to form a committee of 3 from a group of 8 engineers to study design improvements for a product. If two of the
engineers are too inexperienced to serve together on the committee, how many different committees can Ben form?

20
30
50
56
336

Form a committee of 3 from 8 - 8C3 = 56
Exclude groups that have 2 engineers together - If say 1,2 need to be excluded - (1,2,3), (1,2,4), (1,2,5), (1,2,6), (1,2,7), (1,2,8) - 6 - PART 2

56-6 = 50

Is there any formula for such problems, where you can compute part 2 with ease?
Since its a small group, its fairly easy to compute, but if its big, it gets difficult.

Anybody?
when no inexperience engineer is selected total no. of ways would be 6C3 =20;

when one of the inexperience engineer is selected total no. of ways would be 2C1 * 6C2 =30;

hence total no. of ways would be 30+20=50
O Excellence... my search for you is on... you can be far.. but not beyond my reach!

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 1462
Joined: Thu Apr 09, 2015 9:34 am
Location: New York, NY
Thanked: 39 times
Followed by:22 members

by Jeff@TargetTestPrep » Thu Dec 14, 2017 5:45 pm
crimson2283 wrote:Ben needs to form a committee of 3 from a group of 8 engineers to study design improvements for a product. If two of the engineers are too inexperienced to serve together on the committee, how many different committees can Ben form?

20
30
50
56
336
We can use the following formula:

Total number of ways to select the committee = # of ways with both inexperienced engineers selected + # of ways with two inexperienced engineers NOT selected

Thus:

# of ways with two inexperienced engineers NOT selected = Total number of ways to select the committee - # of ways with both inexperienced engineers selected

Total number of ways to select the committee:

8C3 = (8 x 7 x 6)/3! = 56 ways

Now let's calculate the total number of ways to select the committee such that the two inexperienced engineers are both selected. One such occurrence would be:

NNE (N = inexperienced engineer and E = experienced engineer)

Since both inexperienced engineers have been selected, there is only 1 position left, and there are 6 experienced engineers to fill it. Thus, we have:

6C1 = 6

Thus, the number of ways to select the committee members with both inexperienced engineers NOT selected = 56 - 6 = 50.

Answer: C

Jeffrey Miller
Head of GMAT Instruction
[email protected]

Image

See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews