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
CBSE Class 11 Maths · Permutations and Combinations
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.
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).
\( {}^{n}C_{r} = \dfrac{n!}{r!\,(n-r)!} \) and total ways \( = {}^{5}C_{4} \times {}^{12}C_{7} \)
The team can be selected in \( 5 \times 792 = 3960 \) ways.
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.
The team can be selected in \( 5 \times 792 = 3960 \) ways.
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} \).
Answer: The team can be selected in \( 5 \times 792 = 3960 \) ways.
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
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
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?
Answer: The playing team can be selected in \( 15 \times 2002 = 30030 \) ways.