SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 6 Q3(iii)

A committee of \(7\) has to be formed from \(9\) boys and \(4\) girls. In how many ways can this be done when the committee consists of : atmost 3 girls \(?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine picking a team from a group of 9 boys and 4 girls, where the team needs exactly 7 people. The rule says no more than 3 girls can be on the team. So the team could have 0, 1, 2, or 3 girls — with boys filling the rest of the spots. We count how many ways each option works, then add all those counts together. It is like counting different flavour combinations at an ice cream shop — each allowed mix is counted separately, then totalled up.

Answer: The committee can be formed in \( 1632 \) ways.

📖 Committee with At Most 3 Girls

Detailed Explanation

When we form a committee, the order in which members are chosen does not matter, so we use combinations, not permutations. The number of ways to choose \( r \) people from \( n \) people is \( {}^{n}C_{r} \). The phrase 'at most 3 girls' means the committee can have 0, 1, 2, or 3 girls (but not more). For each allowed number of girls, the remaining seats are filled by boys. Since these cases cannot happen at the same time, we count each case separately and ADD the results (this uses the fundamental principle of counting). Within a single case, we choose girls AND boys, so we MULTIPLY the two choices.

Formula Used

\[ {}^{n}C_{r} = \frac{n!}{r!\,(n-r)!} \]

Solution

  1. Step 1: We have 9 boys and 4 girls, and we must form a committee of 7. The condition is 'at most 3 girls', so the number of girls can be 0, 1, 2, or 3. The rest of the 7 seats are filled by boys.
  2. Step 2: List the four possible cases. If the committee has \( g \) girls, it must have \( 7 - g \) boys. Case 1: 0 girls, 7 boys. Case 2: 1 girl, 6 boys. Case 3: 2 girls, 5 boys. Case 4: 3 girls, 4 boys.
  3. Step 3: Count Case 1 (0 girls, 7 boys): \[ {}^{4}C_{0} \times {}^{9}C_{7} = 1 \times 36 = 36 \] Here \( {}^{9}C_{7} = {}^{9}C_{2} = \frac{9 \times 8}{2} = 36 \).
  4. Step 4: Count Case 2 (1 girl, 6 boys): \[ {}^{4}C_{1} \times {}^{9}C_{6} = 4 \times 84 = 336 \] Here \( {}^{9}C_{6} = {}^{9}C_{3} = \frac{9 \times 8 \times 7}{6} = 84 \).
  5. Step 5: Count Case 3 (2 girls, 5 boys): \[ {}^{4}C_{2} \times {}^{9}C_{5} = 6 \times 126 = 756 \] Here \( {}^{4}C_{2} = 6 \) and \( {}^{9}C_{5} = {}^{9}C_{4} = \frac{9 \times 8 \times 7 \times 6}{24} = 126 \).
  6. Step 6: Count Case 4 (3 girls, 4 boys): \[ {}^{4}C_{3} \times {}^{9}C_{4} = 4 \times 126 = 504 \] Here \( {}^{4}C_{3} = 4 \) and \( {}^{9}C_{4} = 126 \).
  7. Step 7: Since the cases are mutually exclusive, add all four results: \[ 36 + 336 + 756 + 504 = 1632 \]

Final Answer

The committee can be formed in \( 1632 \) ways.

Common Mistake

A common mistake is to read 'at most 3 girls' as 'exactly 3 girls' and count only one case. Remember, 'at most 3' includes 0, 1, 2, and 3 girls, so all four cases must be counted and added.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify what is given: 9 boys and 4 girls are available, and we need a committee of 7. The constraint is 'at most 3 girls', meaning the number of girls \( g \) satisfies \( g \le 3 \). Since \( g \) must also be a non-negative whole number and we cannot have more girls than are available (only 4 girls exist), the valid values are \( g = 0, 1, 2, 3 \). For each value of \( g \), the remaining \( 7 - g \) seats go to boys. — Reason: Listing all valid cases first prevents missing any possibility.
  2. Step 2: Set up the four cases clearly. Case 1: 0 girls and 7 boys. Case 2: 1 girl and 6 boys. Case 3: 2 girls and 5 boys. Case 4: 3 girls and 4 boys. Within each case, the number of ways to pick the girls AND the boys are multiplied together (Multiplication Principle), and then all four case totals are added (Addition Principle). — Reason: The cases are mutually exclusive (a committee cannot simultaneously have 0 and 1 girl), so we add; within each case we make two independent selections, so we multiply.
  3. Step 3: Count Case 1 (0 girls, 7 boys). Choosing 0 girls from 4 gives \( {}^{4}C_{0} = 1 \). Choosing 7 boys from 9: using the symmetry property \( {}^{9}C_{7} = {}^{9}C_{2} \), we get \[ {}^{9}C_{2} = \frac{9 \times 8}{2 \times 1} = 36 \] So Case 1 total is \( 1 \times 36 = 36 \). — Reason: Using \( {}^{n}C_{r} = {}^{n}C_{n-r} \) simplifies the arithmetic when \( r \) is large.
  4. Step 4: Count Case 2 (1 girl, 6 boys). Choosing 1 girl from 4 gives \( {}^{4}C_{1} = 4 \). Choosing 6 boys from 9: using symmetry \( {}^{9}C_{6} = {}^{9}C_{3} \), we get \[ {}^{9}C_{3} = \frac{9 \times 8 \times 7}{3 \times 2 \times 1} = \frac{504}{6} = 84 \] So Case 2 total is \( 4 \times 84 = 336 \). — Reason: Each of the 4 girl choices can be paired with each of the 84 boy-group choices, so multiplication applies.
  5. Step 5: Count Case 3 (2 girls, 5 boys). Choosing 2 girls from 4: \[ {}^{4}C_{2} = \frac{4 \times 3}{2 \times 1} = 6 \] Choosing 5 boys from 9: using symmetry \( {}^{9}C_{5} = {}^{9}C_{4} \), we get \[ {}^{9}C_{4} = \frac{9 \times 8 \times 7 \times 6}{4 \times 3 \times 2 \times 1} = \frac{3024}{24} = 126 \] So Case 3 total is \( 6 \times 126 = 756 \). — Reason: Both girl and boy selections are independent, so we multiply the two combination values.
  6. Step 6: Count Case 4 (3 girls, 4 boys). Choosing 3 girls from 4: \[ {}^{4}C_{3} = {}^{4}C_{1} = 4 \] Choosing 4 boys from 9: \[ {}^{9}C_{4} = \frac{9 \times 8 \times 7 \times 6}{4 \times 3 \times 2 \times 1} = 126 \] So Case 4 total is \( 4 \times 126 = 504 \). — Reason: We already computed \( {}^{9}C_{4} = 126 \) in the previous step, saving recalculation effort.
  7. Step 7: Add all four case totals to get the grand total. \[ 36 + 336 + 756 + 504 = 1632 \] — Reason: Because the four cases are mutually exclusive and collectively cover all allowed compositions of the committee, their counts are simply summed.

Final Answer

The committee can be formed in \( 1632 \) ways.

Common Mistake

One common mistake: students forget to include the case of 0 girls (all 7 members are boys), which contributes 36 ways and must not be overlooked when interpreting 'at most 3 girls'.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Cases (girls \\ g, boys \\ 7-g): \\ (0,7), (1,6), (2,5), (3,4)
  2. Step 2: Case 1: \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \\ \({}^{4}C_{0} \times {}^{9}C_{7} = 1 \times 36 = 36\)
  3. Step 3: Case 2: \({}^{4}C_{1} \times {}^{9}C_{6} = 4 \times 84 = 336\) \quad Case 3: \({}^{4}C_{2} \times {}^{9}C_{5} = 6 \times 126 = 756\) \quad Case 4: \({}^{4}C_{3} \times {}^{9}C_{4} = 4 \times 126 = 504\)
  4. Step 4: Total: \(36 + 336 + 756 + 504 = 1632\)

Answer: The committee can be formed in \( 1632 \) ways.

➕ More Examples

More Examples

Example 1

Question: A committee of 8 has to be formed from 10 boys and 5 girls. In how many ways can this be done when the committee consists of at most 2 girls?

Solution: We need to form a committee of 8 from 10 boys and 5 girls such that at most 2 girls are included. This means the committee can have 0 girls, 1 girl, or 2 girls. Case 1: 0 girls and 8 boys. Number of ways = \( {}^{5}C_{0} \times {}^{10}C_{8} \) \[ = 1 \times \frac{10!}{8! \cdot 2!} = 1 \times 45 = 45 \] Case 2: 1 girl and 7 boys. Number of ways = \( {}^{5}C_{1} \times {}^{10}C_{7} \) \[ = 5 \times \frac{10!}{7! \cdot 3!} = 5 \times 120 = 600 \] Case 3: 2 girls and 6 boys. Number of ways = \( {}^{5}C_{2} \times {}^{10}C_{6} \) \[ = \frac{5!}{2! \cdot 3!} \times \frac{10!}{6! \cdot 4!} = 10 \times 210 = 2100 \] Total number of ways = \( 45 + 600 + 2100 \) \[ = 2745 \]

Answer: 2745

Example 2

Question: A team of 6 players has to be selected from 8 men and 6 women. In how many ways can this be done if the team consists of at most 3 women?

Solution: We need to select a team of 6 from 8 men and 6 women such that at most 3 women are included. This means the team can have 0 women, 1 woman, 2 women, or 3 women. Case 1: 0 women and 6 men. Number of ways = \( {}^{6}C_{0} \times {}^{8}C_{6} \) \[ = 1 \times \frac{8!}{6! \cdot 2!} = 1 \times 28 = 28 \] Case 2: 1 woman and 5 men. Number of ways = \( {}^{6}C_{1} \times {}^{8}C_{5} \) \[ = 6 \times \frac{8!}{5! \cdot 3!} = 6 \times 56 = 336 \] Case 3: 2 women and 4 men. Number of ways = \( {}^{6}C_{2} \times {}^{8}C_{4} \) \[ = \frac{6!}{2! \cdot 4!} \times \frac{8!}{4! \cdot 4!} = 15 \times 70 = 1050 \] Case 4: 3 women and 3 men. Number of ways = \( {}^{6}C_{3} \times {}^{8}C_{3} \) \[ = \frac{6!}{3! \cdot 3!} \times \frac{8!}{3! \cdot 5!} = 20 \times 56 = 1120 \] Total number of ways = \( 28 + 336 + 1050 + 1120 \) \[ = 2534 \]

Answer: 2534

🎯 Try a Similar Question

Try a Similar Question

Question: A committee of 8 has to be formed from 10 boys and 5 girls. In how many ways can this be done when the committee consists of at most 2 girls?

Solution

  1. Step 1: Understand the Condition: We need to form a committee of 8 from 10 boys and 5 girls such that the number of girls is at most 2. This means the number of girls can be 0, 1, or 2. We consider three separate cases.
  2. Step 2: Case 1 — 0 Girls and 8 Boys: Choose 0 girls from 5 and 8 boys from 10. The number of ways is: \[ {}^{5}C_{0} \times {}^{10}C_{8} = 1 \times \frac{10!}{8! \cdot 2!} = 1 \times 45 = 45 \]
  3. Step 3: Case 2 — 1 Girl and 7 Boys: Choose 1 girl from 5 and 7 boys from 10. The number of ways is: \[ {}^{5}C_{1} \times {}^{10}C_{7} = 5 \times \frac{10!}{7! \cdot 3!} = 5 \times 120 = 600 \]
  4. Step 4: Case 3 — 2 Girls and 6 Boys: Choose 2 girls from 5 and 6 boys from 10. The number of ways is: \[ {}^{5}C_{2} \times {}^{10}C_{6} = 10 \times \frac{10!}{6! \cdot 4!} = 10 \times 210 = 2100 \]
  5. Step 5: Add All Cases: By the addition principle, the total number of ways is: \[ 45 + 600 + 2100 = 2745 \]

Answer: The committee can be formed in \( 2745 \) ways.

Everything you get with Solver7

More questions in Permutations and Combinations