Probability question: From a group of 8 women, 6 men,

Click For Summary
SUMMARY

The discussion centers on calculating the number of possible committees from a group of 8 women and 6 men, specifically forming a committee of 3 men and 3 women while adhering to the constraint that 2 men refuse to serve together. The total number of committees is calculated using the combination formula, resulting in 96 valid combinations for men and 336 for women. The final count of valid committees is derived from multiplying these two results, taking into account the restrictions imposed by the two men.

PREREQUISITES
  • Understanding of combinatorial mathematics, specifically "n choose k" calculations.
  • Familiarity with the multiplication rule in probability.
  • Basic knowledge of committee formation and constraints in combinatorial problems.
  • Ability to apply logical reasoning to eliminate invalid combinations.
NEXT STEPS
  • Study the application of the combination formula in various combinatorial problems.
  • Learn about advanced counting techniques, including the principle of inclusion-exclusion.
  • Explore the concept of permutations and combinations in probability theory.
  • Investigate real-world applications of combinatorial mathematics in decision-making processes.
USEFUL FOR

Students studying combinatorial mathematics, educators teaching probability theory, and anyone interested in solving complex committee formation problems with constraints.

Jamin2112
Messages
973
Reaction score
12
Probability question: "From a group of 8 women, 6 men, ..."

Homework Statement



From a group of 8 women and 6 men, a committee consisting of 3 men and 3 women is to be formed. How many different committees are possible if [...] 2 of the men refuse to serve together?

Homework Equations



n choose k = n!/((n-k)! * k!)

multiplication rule


The Attempt at a Solution



Clearly the number of total committees that can be formed from 3 of 8 women and 3 of 6 men is (8 choose 3) * (6 choose 3). I need to subtract the number of those committees in which some arbitrary pair of men would've served together. Could someone please explain (or hint at) the logic involved in finding this?

OT link removed
 
Last edited by a moderator:
Physics news on Phys.org


I would do this: call the 6 men a, b, c, d, e, and f and assume, without loss of generality, that the two men who refuse to serve on the same committee are a and b. Then there are three ways to choose the three men to serve on the commitee:
1) Choose a but not b. Then we must choose 2 more men from the four, c, d, e, and f. There are 4(3)= 12 ways to do that.
2) Choose b but not a. As before, there are 12 ways to do that.
3) Choose neither a nor b to be on the committee. That is, we choose 3 out of c, d, e, and f. There are 4(3)(2)= 24 ways to do that.

There are, therefore, 12+ 12+ 48= 96 ways to choose the three men.

There are, as you say. "8 choose 3"= 8(7)(6)= 336 ways to choose the three women.
 


1) Choose a but not b. Then we must choose 2 more men from the four, c, d, e, and f. There are 4(3)= 12 ways to do that.
2) Choose b but not a. As before, there are 12 ways to do that.
3) Choose neither a nor b to be on the committee. That is, we choose 3 out of c, d, e, and f. There are 4(3)(2)= 24 ways to do that.

There are, therefore, 12+ 12+ 48= 96 ways to choose the three men.
I disagree here; order doesn't matter for any group of men, and as such the choose function should show up here.

As far as the OP's elimination method goes, again, order does not matter. How many 'illegal' committees are there? (Hint: think about how many more men there are to choose from, and how big a committee is.)

Alternatively, using the letter system, it's actually not unrealistic to enumerate all possible 'legal' combinations of three men (though I'll grant it's rather tedious).
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 18 ·
Replies
18
Views
2K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
7
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 15 ·
Replies
15
Views
7K