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

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 no girl \(\ ?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have 7 boys and you want to pick 5 of them for a football team. The rule says no girls allowed on this team at all. So you completely ignore the girls and only look at the boys. Picking the same 5 boys in a different order still gives the same team. There are exactly \( 21 \) different groups of 5 boys you can form from those 7 boys.

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

📖 Selecting a Team with No Girls

Detailed Explanation

This is a selection problem, so we use combinations, not permutations, because the order in which team members are chosen does not matter. A team of Ram and Shyam is the same as a team of Shyam and Ram. The condition 'no girl' means every one of the 5 members must be a boy. So the 4 girls are completely ignored, and we only choose from the 7 boys. Whenever we choose \( r \) objects out of \( n \) distinct objects without caring about order, the number of ways is given by the combination formula \( {}^{n}C_{r} \).

Formula Used

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

Solution

  1. Step 1: Understand the restriction. The team must have no girl, so all 5 selected members must be boys. This means we do not select from the 4 girls at all.
  2. Step 2: Identify what to choose. We must choose 5 boys from the available 7 boys. Since order does not matter in forming a team, we use combinations with \( n = 7 \) and \( r = 5 \).
  3. Step 3: Write the combination expression: \[ {}^{7}C_{5} = \frac{7!}{5!\,(7-5)!} = \frac{7!}{5!\,2!} \]
  4. Step 4: Simplify using \( 7! = 7 \times 6 \times 5! \) so the \( 5! \) cancels: \[ {}^{7}C_{5} = \frac{7 \times 6 \times 5!}{5! \times 2!} = \frac{7 \times 6}{2!} \]
  5. Step 5: Compute the value. Since \( 2! = 2 \): \[ {}^{7}C_{5} = \frac{42}{2} = 21 \]

Final Answer

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

Common Mistake

A common mistake is to use permutations \( {}^{7}P_{5} \) instead of combinations, which counts different orders of the same team as different selections. Since a team has no ordering, you must use \( {}^{7}C_{5} \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Read the restriction carefully. The team must contain NO girls. This means every one of the 5 spots must be filled by a boy, so the 4 girls are completely excluded from our selection pool. — Reason: Identifying the constraint tells us which group of people we are actually choosing from, so we do not accidentally include girls in the count.
  2. Step 2: Set up the selection problem. We need to choose 5 boys from the 7 available boys. Since the order in which members are picked does not affect who is on the team, we use combinations with \( n = 7 \) and \( r = 5 \). — Reason: Combinations are used (not permutations) because a team {Ram, Shyam, ...} is the same regardless of the order in which members were chosen.
  3. Step 3: Write the combination expression: \[ {}^{7}C_{5} = \frac{7!}{5!\,(7-5)!} = \frac{7!}{5!\,2!} \] — Reason: Substituting \( n = 7 \) and \( r = 5 \) directly into the combination formula gives us the expression to evaluate.
  4. Step 4: Cancel the factorial \( 5! \) by expanding only the part of \( 7! \) that does not appear in \( 5! \). Using \( 7! = 7 \times 6 \times 5! \): \[ {}^{7}C_{5} = \frac{7 \times 6 \times 5!}{5! \times 2!} = \frac{7 \times 6}{2!} \] — Reason: Cancelling \( 5! \) avoids computing large factorial values and simplifies the arithmetic significantly.
  5. Step 5: Evaluate the remaining expression. Since \( 2! = 2 \times 1 = 2 \): \[ {}^{7}C_{5} = \frac{7 \times 6}{2} = \frac{42}{2} = 21 \] — Reason: Performing the final arithmetic gives the total number of distinct teams that can be formed under the given condition.

Final Answer

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

Common Mistake

One common mistake: Students sometimes use \( {}^{7}P_{5} \) (permutations) instead of \( {}^{7}C_{5} \) (combinations), which overcounts because it treats the order of selection as significant — but in a team, the order in which members are chosen does not matter.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: No girls allowed, so choose 5 from 7 boys: \[ {}^{7}C_{5} = \frac{7!}{5!\,2!} \]
  2. Step 2: Cancel \( 5! \): \[ \frac{7 \times 6 \times 5!}{5! \times 2!} = \frac{7 \times 6}{2} = \frac{42}{2} = 21 \]

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

➕ More Examples

More Examples

Example 1

Question: A club has 5 senior members and 8 junior members. In how many ways can a committee of 4 members be formed if the committee must have no senior member?

Solution: Since no senior member is allowed on the committee, all 4 members must be chosen from the 8 junior members only. Number of ways = \[ {}^{8}C_{4} \] Expanding using the formula: \[ {}^{8}C_{4} = \frac{8!}{4! \times 4!} \] Calculating step by step: \[ {}^{8}C_{4} = \frac{8 \times 7 \times 6 \times 5}{4 \times 3 \times 2 \times 1} \] Simplifying the numerator: \( 8 \times 7 \times 6 \times 5 = 1680 \) Simplifying the denominator: \( 4! = 24 \) Therefore: \[ {}^{8}C_{4} = \frac{1680}{24} = 70 \] So the committee can be formed in 70 ways.

Answer: 70 ways

Example 2

Question: A sports squad consists of 6 defenders and 9 attackers. In how many ways can a playing team of 5 be selected if the team must contain no defenders?

Solution: Since no defender is to be included, all 5 players must be selected from the 9 attackers only. Number of ways = \[ {}^{9}C_{5} \] Expanding: \[ {}^{9}C_{5} = \frac{9!}{5! \times 4!} \] Writing out the factors: \[ {}^{9}C_{5} = \frac{9 \times 8 \times 7 \times 6}{4 \times 3 \times 2 \times 1} \] Calculating the numerator: \( 9 \times 8 \times 7 \times 6 = 3024 \) Calculating the denominator: \( 4! = 24 \) Therefore: \[ {}^{9}C_{5} = \frac{3024}{24} = 126 \] So the team can be selected in 126 ways.

Answer: 126 ways

🎯 Try a Similar Question

Try a Similar Question

Question: A club has 5 women and 8 men. In how many ways can a committee of 4 members be selected if the committee must consist of men only?

Solution

  1. Step 1: Understand the condition: Since the committee must consist of men only, we cannot select any women. All 4 members must be chosen from the 8 men available.
  2. Step 2: Identify the relevant combination: We need to choose 4 men from 8 men. The number of ways to do this is \( {}^{8}C_{4} \).
  3. Step 3: Apply the combination formula: Using the formula \( {}^{n}C_{r} = \frac{n!}{r!(n-r)!} \), we get: \[ {}^{8}C_{4} = \frac{8!}{4! \times 4!} \]
  4. Step 4: Expand and simplify: Expanding the factorials: \[ {}^{8}C_{4} = \frac{8 \times 7 \times 6 \times 5}{4 \times 3 \times 2 \times 1} \] Calculating the numerator: \( 8 \times 7 \times 6 \times 5 = 1680 \). Calculating the denominator: \( 4 \times 3 \times 2 \times 1 = 24 \).
  5. Step 5: Compute the final value: Dividing, we get: \[ {}^{8}C_{4} = \frac{1680}{24} = 70 \] Therefore, the committee can be selected in 70 ways.

Answer: The committee can be selected in \( 70 \) ways.

Everything you get with Solver7

More questions in Permutations and Combinations