SOLVER7 Study. Nothing Else.
Exercise 6.4 Q7

In how many ways can one select a cricket team of eleven from \(17\) players in which only \(5\) players can bowl if each cricket team of \(11\) must include exactly \(4\) bowlers \(?\)

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine picking players for a cricket team from a big group. Some players are bowlers and the rest are all-rounders or batters. The rule says exactly 4 bowlers must be in the team. So you pick 4 bowlers from the 5 available bowlers. Then you fill the remaining 7 spots from the other 12 players. Multiply both choices together to get all possible teams. It is just like choosing toppings for a pizza — pick some from one bowl and some from another.

Answer: The team can be selected in \( 5 \times 792 = 3960 \) ways.

📖 Selecting a Cricket Team with Exactly 4 Bowlers

Detailed Explanation

When the order of selection does not matter, we use combinations, written \( {}^{n}C_{r} \), which counts the number of ways to choose \( r \) items from \( n \) distinct items. Here we must build a team of 11 from 17 players. But the 17 players are not all the same: 5 of them are bowlers and the remaining 12 are non-bowlers. The condition says the team must contain exactly 4 bowlers. So we split the problem into two independent choices: choosing the bowlers from the bowler group, and choosing the rest from the non-bowler group. Since these two choices are made together and independently, we multiply the number of ways (fundamental principle of counting).

Formula Used

\( {}^{n}C_{r} = \dfrac{n!}{r!\,(n-r)!} \) and total ways \( = {}^{5}C_{4} \times {}^{12}C_{7} \)

Solution

  1. Step 1: Split the 17 players into two groups. There are 5 bowlers and the remaining \( 17 - 5 = 12 \) are non-bowlers.
  2. Step 2: The team of 11 must have exactly 4 bowlers. So the number of non-bowlers needed is \( 11 - 4 = 7 \).
  3. Step 3: Choose 4 bowlers from the 5 available bowlers. This can be done in \( {}^{5}C_{4} \) ways. \[ {}^{5}C_{4} = \frac{5!}{4!\,1!} = 5 \]
  4. Step 4: Choose the remaining 7 players from the 12 non-bowlers. This can be done in \( {}^{12}C_{7} \) ways. \[ {}^{12}C_{7} = \frac{12!}{7!\,5!} = 792 \]
  5. Step 5: Since the bowlers and non-bowlers are chosen together, multiply the two results using the fundamental principle of counting. \[ \text{Total} = {}^{5}C_{4} \times {}^{12}C_{7} = 5 \times 792 = 3960 \]

Final Answer

The team can be selected in \( 5 \times 792 = 3960 \) ways.

Common Mistake

A common mistake is to choose the bowlers from all 17 players or to choose the remaining 7 players from all leftover players instead of only from the 12 non-bowlers. You must keep the two groups separate: pick 4 bowlers only from the 5 bowlers, and 7 players only from the 12 non-bowlers.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the two groups of players. Out of 17 players, 5 are bowlers and the remaining \( 17 - 5 = 12 \) are non-bowlers. — Reason: Separating players by type lets us apply the constraint (exactly 4 bowlers) to each group independently.
  2. Step 2: Determine how many from each group are needed in the team. The team has 11 players with exactly 4 bowlers, so the number of non-bowlers required is \( 11 - 4 = 7 \). — Reason: Once the bowler count is fixed at 4, the remaining spots are automatically filled by non-bowlers.
  3. Step 3: Count the ways to choose 4 bowlers from the 5 available bowlers using the combination formula: \[ {}^{5}C_{4} = \frac{5!}{4!\,1!} = \frac{5 \times 4!}{4! \times 1} = 5 \] — Reason: Since the order in which bowlers are picked does not matter, combinations (not permutations) are the right tool here.
  4. Step 4: Count the ways to choose 7 non-bowlers from the 12 available non-bowlers: \[ {}^{12}C_{7} = \frac{12!}{7!\,5!} = \frac{12 \times 11 \times 10 \times 9 \times 8}{5 \times 4 \times 3 \times 2 \times 1} = 792 \] — Reason: Again, order of selection does not matter within the non-bowler group, so we use combinations.
  5. Step 5: Multiply the two results together using the Fundamental Principle of Counting: \[ {}^{5}C_{4} \times {}^{12}C_{7} = 5 \times 792 = 3960 \] — Reason: The two selections (bowlers and non-bowlers) are independent of each other; for every way of picking bowlers there are 792 ways of picking non-bowlers, so the totals multiply.

Final Answer

The team can be selected in \( 5 \times 792 = 3960 \) ways.

Common Mistake

One common mistake: Students forget to subtract the number of non-bowlers correctly and attempt to choose 7 players from all 17 (ignoring the bowler restriction), giving an incorrect answer of \( {}^{5}C_{4} \times {}^{17}C_{7} \) instead of \( {}^{5}C_{4} \times {}^{12}C_{7} \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Bowlers: 5, Non-bowlers: \( 17 - 5 = 12 \); Team needs 4 bowlers and \( 11 - 4 = 7 \) non-bowlers.
  2. Step 2: \[ {}^{5}C_{4} = \frac{5!}{4! \cdot 1!} = 5 \]
  3. Step 3: \[ {}^{12}C_{7} = \frac{12!}{7! \cdot 5!} = 792 \]
  4. Step 4: \[ {}^{5}C_{4} \times {}^{12}C_{7} = 5 \times 792 = 3960 \]

Answer: The team can be selected in \( 5 \times 792 = 3960 \) ways.

➕ More Examples

More Examples

Example 1

Question: A football squad has 20 players, of whom only 6 are goalkeepers. In how many ways can a playing team of 11 be selected if the team must include exactly 2 goalkeepers?

Solution: We split the selection into two independent parts. Step 1: Choose 2 goalkeepers from the 6 available goalkeepers. \[ {}^{6}C_{2} = \frac{6!}{2! \cdot 4!} = \frac{6 \times 5}{2 \times 1} = 15 \] Step 2: The remaining team spots = 11 - 2 = 9, filled from the remaining non-goalkeeper players. Number of non-goalkeepers = 20 - 6 = 14. \[ {}^{14}C_{9} = \frac{14!}{9! \cdot 5!} = \frac{14 \times 13 \times 12 \times 11 \times 10}{5 \times 4 \times 3 \times 2 \times 1} = \frac{240240}{120} = 2002 \] Step 3: By the Fundamental Principle of Counting, multiply both results. \[ \text{Total ways} = {}^{6}C_{2} \times {}^{14}C_{9} = 15 \times 2002 = 30030 \]

Answer: 30030 ways

Example 2

Question: A debate club has 15 members, of whom 4 are experienced debaters. A team of 6 members must be chosen such that exactly 3 of the 4 experienced debaters are included. In how many ways can this be done?

Solution: We split the selection into two independent parts. Step 1: Choose 3 experienced debaters from the 4 available. \[ {}^{4}C_{3} = \frac{4!}{3! \cdot 1!} = 4 \] Step 2: The remaining team spots = 6 - 3 = 3, filled from the non-experienced members. Number of non-experienced members = 15 - 4 = 11. \[ {}^{11}C_{3} = \frac{11!}{3! \cdot 8!} = \frac{11 \times 10 \times 9}{3 \times 2 \times 1} = \frac{990}{6} = 165 \] Step 3: By the Fundamental Principle of Counting, multiply both results. \[ \text{Total ways} = {}^{4}C_{3} \times {}^{11}C_{3} = 4 \times 165 = 660 \]

Answer: 660 ways

🎯 Try a Similar Question

Try a Similar Question

Question: A football squad has 20 players, of whom exactly 6 are goalkeepers. In how many ways can a playing team of 11 be selected from this squad if each team must include exactly 2 goalkeepers?

Solution

  1. Step 1: Understand the problem: We have 20 players in total. Out of these, 6 are goalkeepers and the remaining \( 20 - 6 = 14 \) are non-goalkeepers. We need to select a team of 11 players such that exactly 2 are goalkeepers and the remaining 9 are non-goalkeepers.
  2. Step 2: Count ways to select the goalkeepers: We need to choose exactly 2 goalkeepers from the 6 available goalkeepers. The number of ways to do this is \( {}^{6}C_{2} \).
  3. Step 3: Evaluate the goalkeeper selection: \[ {}^{6}C_{2} = \frac{6!}{2! \times 4!} = \frac{6 \times 5}{2 \times 1} = 15 \]
  4. Step 4: Count ways to select the non-goalkeepers: We need to choose the remaining \( 11 - 2 = 9 \) players from the 14 non-goalkeepers. The number of ways to do this is \( {}^{14}C_{9} \).
  5. Step 5: Evaluate the non-goalkeeper selection: \[ {}^{14}C_{9} = {}^{14}C_{5} = \frac{14!}{5! \times 9!} = \frac{14 \times 13 \times 12 \times 11 \times 10}{5 \times 4 \times 3 \times 2 \times 1} \] Calculating the numerator: \( 14 \times 13 = 182 \), \( 182 \times 12 = 2184 \), \( 2184 \times 11 = 24024 \), \( 24024 \times 10 = 240240 \). Calculating the denominator: \( 5! = 120 \). Therefore \[ {}^{14}C_{9} = \frac{240240}{120} = 2002 \]
  6. Step 6: Apply the Multiplication Principle: By the fundamental principle of counting, the total number of ways to select the team is the product of the two independent choices: \[ {}^{6}C_{2} \times {}^{14}C_{9} = 15 \times 2002 = 30030 \]

Answer: The playing team can be selected in \( 15 \times 2002 = 30030 \) ways.

Everything you get with Solver7

More questions in Permutations and Combinations