Number of ways to form a committee with men and women

  • Thread starter Thread starter semidevil
  • Start date Start date
  • Tags Tags
    Form Women
Click For Summary
SUMMARY

The discussion centers on calculating the number of ways to form a committee of 2 women and 3 men from a group of 5 women and 7 men, with a specific condition regarding two feuding men. The initial calculation yields 350 possible committees using the formula C(5; 2)C(7; 3). When accounting for the feuding men, the author derives a new total of 300 committees by excluding combinations that include both feuding men, calculated as C(7; 3) - C(2; 2)C(5; 1). The use of combinatorial notation C(n; r) is clarified, indicating the number of ways to choose r elements from a set of n elements.

PREREQUISITES
  • Understanding of combinatorial mathematics, specifically combinations
  • Familiarity with the notation C(n; r) for combinations
  • Basic knowledge of set theory and grouping
  • Ability to perform calculations involving factorials
NEXT STEPS
  • Study combinatorial principles in depth, focusing on permutations and combinations
  • Learn how to apply the inclusion-exclusion principle in combinatorial problems
  • Explore advanced combinatorial problems involving restrictions and conditions
  • Practice solving similar problems using different group sizes and conditions
USEFUL FOR

Students studying combinatorial mathematics, educators teaching probability and statistics, and anyone interested in solving complex grouping problems in mathematics.

semidevil
Messages
156
Reaction score
2

Homework Statement


From a group of 5 women and 7 men, how many different committees con-
sisting of 2 women and 3 men can be formed? What if 2 of the men are
feuding and refuse to serve on the committee together?

Part 1:
my attempt:
for men, we have 7 choose 3
for woman, we have 5 choose 2.
multiply together, and we get 350 possible committees

Part 2 - what if 2 of the men are feuding.
I'm trying to grasp the concept of that and what it means and how to build an equation for it. So we have 7 men and any 2 can be feuding, so if A and B are feuding, A can still serve with C, D, E, F, or G. So that means 5 ways for A. B can do the same, so 5 ways for B, 5 ways for C, 5 ways for D, 5 ways for E which is 30 ways. The men can be swapped around in 30 ways.
Women can still be grouped into 5 choose 2, so 30 x 10 = 300.

I was able to work out the solution manually thinking it out, but I want to know how the author did it for part 2.

author solution:

There are C(5; 2)C(7; 3) = 350 possible committees consisting of 2 women
and 3 men. Now, if we suppose that 2 men are feuding and refuse to serve
together then the number of committees that do not include the two men
is C(7; 3) - C(2; 2)C(5; 1) = 30 possible groups. Because there are still
C(5; 2) = 10 possible ways to choose the 2 women, it follows that there are
30 10 = 300 possible committees

what is C(2; 2) and C(5; 1)?? how did he come up with that?
 
Physics news on Phys.org
He's using C(n;r) to mean n-choose-r, sometimes written nCr, nCr, or Cnr.

He has divided the men into two groups - the two feuders and the other five. If C(7;3) is all groups of three men, and C(7;3)-C(2;2)C(5;1) is all groups not including both feuders, what must C(2;2)C(5;1) be?
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
6K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
10K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K