What is the number of ways of choosing \(4\) cards from a pack of \(52\) playing cards? In how many of these four cards belong to four different suits,
CBSE Class 11 Maths · Permutations and Combinations
CBSE Class 11 Maths · Permutations and Combinations
Imagine you have a huge pile of 52 playing cards spread on a table. You want to pick any 4 cards without caring about order — like grabbing a handful. The total number of different handfuls you can grab is 270725. Now think of the deck as four coloured buckets (suits), each holding 13 cards. Picking one card from every bucket gives all four suits covered. Multiply the choices from each bucket together. That gives 28561 special handfuls where every card comes from a different suit.
Answer: Total ways of choosing 4 cards: \( {}^{52}C_{4} = 270725 \). Ways with all four cards from different suits: \( 13^{4} = 28561 \).
When we choose objects and the order of choosing does NOT matter, we use combinations, written as \( {}^{n}C_{r} \). Here we are simply forming a group of 4 cards from 52 cards, so order is irrelevant. For the second part, a standard deck has 4 suits (spades, hearts, diamonds, clubs), each containing 13 cards. Since the four chosen cards must belong to four different suits, we must pick exactly one card from each suit. To do this we use the Fundamental Principle of Counting: pick one card from each suit and multiply the choices together.
Number of ways of choosing \( r \) objects from \( n \) objects: \[ {}^{n}C_{r} = \frac{n!}{r!\,(n-r)!} \]
Total ways of choosing 4 cards: \( {}^{52}C_{4} = 270725 \). Ways with all four cards from different suits: \( 13^{4} = 28561 \).
A common mistake is to compute the second part as \( {}^{52}C_{4} \) again, or to use \( {}^{4}C_{4} \times 13 \). Remember: you choose one card from EACH of the four suits, so it is \( 13 \times 13 \times 13 \times 13 \), not a single combination on all 52 cards.
Total ways of choosing 4 cards: \( {}^{52}C_{4} = 270725 \). Ways with all four cards from different suits: \( 13^{4} = 28561 \).
One common mistake: students sometimes compute the second part as \( {}^{13}C_{1} \times {}^{13}C_{1} \times {}^{13}C_{1} \times {}^{13}C_{1} \) correctly but then mistakenly add the four counts instead of multiplying them, giving \( 13 + 13 + 13 + 13 = 52 \) instead of the correct \( 13^{4} = 28561 \). The Fundamental Principle of Counting requires multiplication for independent sequential choices, not addition.
Answer: Total ways of choosing 4 cards: \( {}^{52}C_{4} = 270725 \). Ways with all four cards from different suits: \( 13^{4} = 28561 \).
Question: In how many ways can 5 cards be chosen from a standard pack of 52 playing cards? In how many of these selections do all 5 cards belong to five different denominations (i.e., no two cards share the same face value, where denominations are Ace, 2, 3, …, 10, Jack, Queen, King — 13 in total)?
Solution: A standard pack has 52 cards. We need to choose 5 cards from 52. Total number of ways to choose 5 cards from 52: \[ {}^{52}C_{5} = \frac{52!}{5! \cdot 47!} = \frac{52 \times 51 \times 50 \times 49 \times 48}{5!} \] Now, \( 5! = 120 \), so: \[ {}^{52}C_{5} = \frac{52 \times 51 \times 50 \times 49 \times 48}{120} \] Computing step by step: \( 52 \times 51 = 2652 \), then \( 2652 \times 50 = 132600 \), then \( 132600 \times 49 = 6497400 \), then \( 6497400 \times 48 = 311875200 \). Dividing by 120: \[ {}^{52}C_{5} = \frac{311875200}{120} = 2598960 \] Now, for the restricted selection: all 5 cards must have 5 different denominations. Step 1: Choose 5 denominations from 13 available denominations. \[ {}^{13}C_{5} = \frac{13!}{5! \cdot 8!} = \frac{13 \times 12 \times 11 \times 10 \times 9}{120} = \frac{154440}{120} = 1287 \] Step 2: For each chosen denomination, any one of the 4 suits can be picked. So for each of the 5 denominations, we choose 1 card from 4: \[ {}^{4}C_{1} = 4 \] Since this choice is made independently for each of the 5 denominations, the number of ways for this step is: \[ 4^5 = 1024 \] Step 3: By the Fundamental Principle of Counting, the total number of favourable selections is: \[ 1287 \times 1024 = 1317888 \] Therefore, the total number of ways to choose 5 cards from 52 is \( 2598960 \), and the number of ways in which all 5 cards belong to different denominations is \( 1317888 \).
Answer: Total ways: \( 2598960 \); Ways with all different denominations: \( 1317888 \)
Question: A bag contains 6 red balls, 5 blue balls, and 4 green balls (15 balls in total). In how many ways can 3 balls be selected from the bag? In how many of these selections does exactly one ball of each colour appear?
Solution: The bag has 15 balls in total (6 red, 5 blue, 4 green). We select 3 balls. Total number of ways to choose 3 balls from 15: \[ {}^{15}C_{3} = \frac{15!}{3! \cdot 12!} = \frac{15 \times 14 \times 13}{3!} = \frac{2730}{6} = 455 \] Now, for the restricted selection: exactly one ball of each colour. Step 1: Choose 1 red ball from 6 red balls. \[ {}^{6}C_{1} = 6 \] Step 2: Choose 1 blue ball from 5 blue balls. \[ {}^{5}C_{1} = 5 \] Step 3: Choose 1 green ball from 4 green balls. \[ {}^{4}C_{1} = 4 \] By the Fundamental Principle of Counting, the number of ways to select exactly one ball of each colour is: \[ {}^{6}C_{1} \times {}^{5}C_{1} \times {}^{4}C_{1} = 6 \times 5 \times 4 = 120 \] Therefore, the total number of ways to choose 3 balls from 15 is \( 455 \), and the number of ways in which exactly one ball of each colour is selected is \( 120 \).
Answer: Total ways: \( 455 \); Ways with one ball of each colour: \( 120 \)
Question: A standard deck has 52 playing cards divided equally into 4 suits (Spades, Hearts, Diamonds, Clubs), each suit containing 13 cards. In how many ways can 5 cards be chosen from this deck? Among all such selections, in how many ways do exactly 3 of the 5 cards belong to three different suits (one card from each of exactly three chosen suits) while the remaining 2 cards both come from the same fourth suit?
Answer: Total ways of choosing 5 cards from 52: \( {}^{52}C_{5} = 2598960 \). Ways in which exactly one suit contributes 2 cards and the other three suits each contribute 1 card: \[ 4 \times {}^{13}C_{2} \times 13^{3} = 4 \times 78 \times 2197 = 685464 \]