SOLVER7 Study. Nothing Else.
Chapter 6 Miscellaneous Examples Q21(iii)

A group consists of \(4\) girls and \(7\) boys. In how many ways can a team of \(5\) members be selected if the team has at least \(3\) girls \(\ ?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine picking a sports team from a group of 4 girls and 7 boys, and the team must have 5 people. You want at least 3 girls on the team. There are two ways this can happen: either 3 girls join with 2 boys, or all 4 girls join with 1 boy. You count how many ways each choice works, then add both counts together. It is like counting how many different friend groups you can make under certain rules.

Answer: The team can be selected in \( 91 \) ways.

📖 Selecting a Team with At Least 3 Girls

Detailed Explanation

When we select a group of members and the order does not matter, we use combinations, written as \( {}^{n}C_{r} \), which counts the number of ways to choose \( r \) items from \( n \) items. The phrase 'at least 3 girls' means the team can have 3 girls or 4 girls (we have only 4 girls in total). These are separate, non-overlapping cases, so we count each case and then ADD the results (Sum Rule). Inside each case, choosing girls AND boys are independent choices, so we MULTIPLY the two combination values (Product Rule).

Formula Used

\( {}^{n}C_{r} = \dfrac{n!}{r!\,(n-r)!} \)

Solution

  1. Step 1: Identify the total available members. There are 4 girls and 7 boys, and we must form a team of 5 members with at least 3 girls.
  2. Step 2: List the valid cases. Since there are only 4 girls, 'at least 3 girls' gives two cases: Case A with exactly 3 girls and 2 boys, and Case B with exactly 4 girls and 1 boy.
  3. Step 3: Count Case A (3 girls, 2 boys). Choose 3 girls from 4 and 2 boys from 7: \[ {}^{4}C_{3} \times {}^{7}C_{2} \] Now compute each part: \[ {}^{4}C_{3} = 4 \] \[ {}^{7}C_{2} = \frac{7 \times 6}{2 \times 1} = 21 \] So Case A gives \[ 4 \times 21 = 84 \]
  4. Step 4: Count Case B (4 girls, 1 boy). Choose all 4 girls from 4 and 1 boy from 7: \[ {}^{4}C_{4} \times {}^{7}C_{1} \] Compute each part: \[ {}^{4}C_{4} = 1 \] \[ {}^{7}C_{1} = 7 \] So Case B gives \[ 1 \times 7 = 7 \]
  5. Step 5: Add the cases using the Sum Rule, since the two cases cannot happen together: \[ 84 + 7 = 91 \]

Final Answer

The team can be selected in \( 91 \) ways.

Common Mistake

A common mistake is adding the girl and boy combinations within a case instead of multiplying them, or forgetting the second case (4 girls, 1 boy) and only counting 3 girls. Always multiply within a case and add across separate cases.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Note that the group consists of 4 girls and 7 boys, and we need a team of 5 members with at least 3 girls. — Reason: Reading the problem carefully tells us the pool sizes and the constraint we must satisfy.
  2. Step 2: Since there are only 4 girls available, 'at least 3 girls' means exactly two scenarios are possible: Case A — exactly 3 girls and 2 boys, and Case B — exactly 4 girls and 1 boy. — Reason: We cannot have 5 or more girls when only 4 exist, so these two cases cover all possibilities without any overlap.
  3. Step 3: For Case A (3 girls and 2 boys), the number of ways is \[ {}^{4}C_{3} \times {}^{7}C_{2} \] Computing each factor separately: \[ {}^{4}C_{3} = \frac{4!}{3!\,1!} = 4 \] and \[ {}^{7}C_{2} = \frac{7!}{2!\,5!} = \frac{7 \times 6}{2 \times 1} = 21 \] So Case A gives \[ 4 \times 21 = 84 \] — Reason: Choosing girls and boys are independent selections, so we multiply the two combination values (Product Rule).
  4. Step 4: For Case B (4 girls and 1 boy), the number of ways is \[ {}^{4}C_{4} \times {}^{7}C_{1} \] Computing each factor: \[ {}^{4}C_{4} = \frac{4!}{4!\,0!} = 1 \] and \[ {}^{7}C_{1} = 7 \] So Case B gives \[ 1 \times 7 = 7 \] — Reason: Selecting all 4 girls can happen in exactly 1 way, and then any one of the 7 boys is chosen.
  5. Step 5: Add the results from both cases: \[ 84 + 7 = 91 \] — Reason: Since Case A and Case B cannot happen at the same time (they are mutually exclusive), the Sum Rule tells us to add the counts to get the total number of valid teams.

Final Answer

The team can be selected in \( 91 \) ways.

Common Mistake

One common mistake: students forget that 'at least 3 girls' includes both the 3-girl case and the 4-girl case, and they calculate only Case A (3 girls, 2 boys), arriving at 84 instead of the correct answer 91.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: 4 girls, 7 boys, team of 5 with at least 3 girls. Two cases: (3 girls, 2 boys) and (4 girls, 1 boy).
  2. Step 2: Case A: \[ {}^{4}C_{3} \times {}^{7}C_{2} = 4 \times 21 = 84 \]
  3. Step 3: Case B: \[ {}^{4}C_{4} \times {}^{7}C_{1} = 1 \times 7 = 7 \]
  4. Step 4: Total: \[ 84 + 7 = 91 \]

Answer: The team can be selected in \( 91 \) ways.

➕ More Examples

More Examples

Example 1

Question: A committee of 6 members is to be formed from 5 women and 8 men. In how many ways can the committee be selected if it must contain at least 4 women?

Solution: We need to form a committee of 6 members from 5 women and 8 men such that there are at least 4 women. The possible cases are: Case 1: Exactly 4 women and 2 men. Number of ways = \[ {}^{5}C_{4} \times {}^{8}C_{2} \] Computing each part: \( {}^{5}C_{4} = 5 \) and \( {}^{8}C_{2} = \frac{8 \times 7}{2 \times 1} = 28 \) So the number of ways for Case 1 = \[ 5 \times 28 = 140 \] Case 2: Exactly 5 women and 1 man. Number of ways = \[ {}^{5}C_{5} \times {}^{8}C_{1} \] Computing each part: \( {}^{5}C_{5} = 1 \) and \( {}^{8}C_{1} = 8 \) So the number of ways for Case 2 = \[ 1 \times 8 = 8 \] Note: A case of 6 women is not possible since there are only 5 women available. Total number of ways = \[ 140 + 8 = 148 \]

Answer: 148 ways

Example 2

Question: A team of 5 players is to be selected from a squad consisting of 3 seniors and 9 juniors. In how many ways can the team be formed if it must include at least 2 seniors?

Solution: We need to select 5 players from 3 seniors and 9 juniors such that there are at least 2 seniors. The possible cases are: Case 1: Exactly 2 seniors and 3 juniors. Number of ways = \[ {}^{3}C_{2} \times {}^{9}C_{3} \] Computing each part: \( {}^{3}C_{2} = 3 \) and \( {}^{9}C_{3} = \frac{9 \times 8 \times 7}{3 \times 2 \times 1} = 84 \) So the number of ways for Case 1 = \[ 3 \times 84 = 252 \] Case 2: Exactly 3 seniors and 2 juniors. Number of ways = \[ {}^{3}C_{3} \times {}^{9}C_{2} \] Computing each part: \( {}^{3}C_{3} = 1 \) and \( {}^{9}C_{2} = \frac{9 \times 8}{2 \times 1} = 36 \) So the number of ways for Case 2 = \[ 1 \times 36 = 36 \] Note: Cases with 4 or more seniors are not possible since there are only 3 seniors. Total number of ways = \[ 252 + 36 = 288 \]

Answer: 288 ways

🎯 Try a Similar Question

Try a Similar Question

Question: A committee consists of 5 women and 6 men. In how many ways can a team of 6 members be selected if the team must have at least 4 women?

Solution

  1. Step 1: Understand the condition: The team of 6 must have at least 4 women. Since there are only 5 women in total, the possible cases are: Case 1: Exactly 4 women and 2 men Case 2: Exactly 5 women and 1 man
  2. Step 2: Count combinations for Case 1 (4 women, 2 men): We choose 4 women from 5 and 2 men from 6. The number of ways is \( {}^{5}C_{4} \times {}^{6}C_{2} \). Calculating each: \( {}^{5}C_{4} = \frac{5!}{4! \cdot 1!} = 5 \) and \( {}^{6}C_{2} = \frac{6!}{2! \cdot 4!} = \frac{6 \times 5}{2} = 15 \). So the number of ways for Case 1 is \( 5 \times 15 = 75 \).
  3. Step 3: Count combinations for Case 2 (5 women, 1 man): We choose all 5 women from 5 and 1 man from 6. The number of ways is \( {}^{5}C_{5} \times {}^{6}C_{1} \). Calculating each: \( {}^{5}C_{5} = 1 \) and \( {}^{6}C_{1} = 6 \). So the number of ways for Case 2 is \( 1 \times 6 = 6 \).
  4. Step 4: Add the results from all cases: By the Addition Principle, the total number of ways to form the team is: \[ 75 + 6 = 81 \]

Answer: The team can be selected in \( 81 \) ways.

Everything you get with Solver7

More questions in Permutations and Combinations