SOLVER7 Study. Nothing Else.
Miscellaneous Exercise Chapter 6 Q8

Determine the number of \(5\)-card combinations out of a deck of \(52\) cards if each selection of \(5\) cards has exactly one king.

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine a deck of 52 playing cards like a big box of coloured chocolates. Four of them are special gold chocolates called kings. You want to pick 5 chocolates such that exactly one is gold. So you pick one gold chocolate from the four available, then pick four ordinary chocolates from the remaining 48. Counting how many ways you can do this gives you a very large number. Multiplying the choices together gives the total number of different 5-card hands with exactly one king.

Answer: The number of 5-card combinations having exactly one king is \( 4 \times {}^{48}C_{4} = 778320 \).

📖 5-Card Combinations with Exactly One King

Detailed Explanation

A standard deck has 52 cards, of which 4 are kings and the remaining 48 are non-kings. Since the order in which we pick cards does not matter, we use combinations, not permutations. The phrase 'exactly one king' means our 5-card hand must contain precisely 1 king and 4 non-king cards. We split the selection into two independent parts: choosing the king, and choosing the non-kings. By the fundamental principle of counting, we multiply the number of ways for each part to get the total number of hands.

Formula Used

Number of ways to choose \( r \) objects from \( n \) distinct objects: \[ {}^{n}C_{r} = \frac{n!}{r!\,(n - r)!} \] Total combinations by multiplication principle: \( {}^{4}C_{1} \times {}^{48}C_{4} \).

Solution

  1. Step 1: Split the deck into two groups. Out of 52 cards, there are 4 kings and \( 52 - 4 = 48 \) non-king cards. A hand with exactly one king needs 1 card from the kings and 4 cards from the non-kings.
  2. Step 2: Choose the single king. The number of ways to select 1 king from the 4 available kings is \[ {}^{4}C_{1} = \frac{4!}{1!\,3!} = 4. \]
  3. Step 3: Choose the four non-king cards. The number of ways to select 4 cards from the 48 non-kings is \[ {}^{48}C_{4} = \frac{48!}{4!\,44!}. \] Expanding the top four factors gives \[ {}^{48}C_{4} = \frac{48 \times 47 \times 46 \times 45}{4 \times 3 \times 2 \times 1}. \]
  4. Step 4: Evaluate the non-king count. First the numerator: \[ 48 \times 47 \times 46 \times 45 = 4677240. \] The denominator is \( 4! = 24 \). So \[ {}^{48}C_{4} = \frac{4677240}{24} = 194580. \]
  5. Step 5: Apply the multiplication principle. Since choosing the king and choosing the non-kings are independent, multiply the two results: \[ {}^{4}C_{1} \times {}^{48}C_{4} = 4 \times 194580 = 778320. \]

Final Answer

The number of 5-card combinations having exactly one king is \( 4 \times {}^{48}C_{4} = 778320 \).

Common Mistake

A common error is using \( {}^{51}C_{4} \) or \( {}^{48}C_{5} \) for the remaining cards. Once you fix exactly one king, the other 4 cards must be chosen ONLY from the 48 non-kings (not from all remaining 51), otherwise you might accidentally include a second king and break the 'exactly one king' condition.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Understand the deck composition. A standard deck has 52 cards total, of which 4 are kings and \( 52 - 4 = 48 \) are non-kings. — Reason: Knowing exactly how many kings and non-kings exist lets us set up the two separate counting tasks correctly.
  2. Step 2: Identify what 'exactly one king' means for a 5-card hand. We need to pick exactly 1 card from the 4 kings AND exactly 4 cards from the 48 non-kings, so that the total is \( 1 + 4 = 5 \) cards. — Reason: Breaking the hand into two groups (king cards and non-king cards) allows us to count each part separately and then combine.
  3. Step 3: Count the ways to choose 1 king from 4 kings: \[ {}^{4}C_{1} = \frac{4!}{1! \times 3!} = \frac{4}{1} = 4 \] — Reason: There are only 4 kings in the deck, and we must pick exactly one, giving 4 possible single-king selections.
  4. Step 4: Set up the expression to choose 4 non-kings from 48 non-kings: \[ {}^{48}C_{4} = \frac{48!}{4! \times 44!} = \frac{48 \times 47 \times 46 \times 45}{4 \times 3 \times 2 \times 1} \] — Reason: We only need the top 4 factors of 48! because the \( 44! \) in the denominator cancels everything below 45.
  5. Step 5: Compute the numerator of \( {}^{48}C_{4} \). First, \( 48 \times 47 = 2256 \). Then \( 2256 \times 46 = 103776 \). Finally, \( 103776 \times 45 = 4669920 \). — Reason: Multiplying step by step avoids errors with large numbers.
  6. Step 6: Divide by \( 4! = 24 \) to get \( {}^{48}C_{4} \): \[ {}^{48}C_{4} = \frac{4669920}{24} = 194580 \] — Reason: Dividing by \( 4! \) removes the overcounting caused by different orderings of the same 4 non-king cards.
  7. Step 7: Apply the multiplication principle. The total number of valid 5-card hands is \[ {}^{4}C_{1} \times {}^{48}C_{4} = 4 \times 194580 = 778320 \] — Reason: Since the choice of king and the choice of non-kings are independent events, we multiply their counts to get all possible combinations.

Final Answer

The number of 5-card combinations having exactly one king is \( 4 \times {}^{48}C_{4} = 778320 \).

Common Mistake

One common mistake: Students sometimes use permutations (\( {}^{n}P_{r} \)) instead of combinations (\( {}^{n}C_{r} \)), overcounting hands where the same set of cards is arranged in a different order — remember that a card hand is unordered, so always use \( {}^{n}C_{r} \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Deck: 4 kings, 48 non-kings. Select 1 king from 4: \[ {}^{4}C_{1} = 4 \]
  2. Step 2: Select 4 non-kings from 48: \[ {}^{48}C_{4} = \frac{48 \times 47 \times 46 \times 45}{4 \times 3 \times 2 \times 1} = \frac{4677240}{24} = 194580 \]
  3. Step 3: Total = \( {}^{4}C_{1} \times {}^{48}C_{4} = 4 \times 194580 = 778320 \)

Answer: The number of 5-card combinations having exactly one king is \( 4 \times {}^{48}C_{4} = 778320 \).

➕ More Examples

More Examples

Example 1

Question: A standard deck of 52 cards is used. Find the number of 6-card combinations such that each selection contains exactly 2 aces.

Solution: A standard deck has 4 aces and 48 non-ace cards. We need to choose exactly 2 aces from the 4 aces, and the remaining 4 cards from the 48 non-ace cards. Step 1: Choose 2 aces from 4 aces. \[ {}^{4}C_{2} = \frac{4!}{2! \cdot 2!} = 6 \] Step 2: Choose 4 cards from the remaining 48 non-ace cards. \[ {}^{48}C_{4} = \frac{48!}{4! \cdot 44!} = \frac{48 \times 47 \times 46 \times 45}{4 \times 3 \times 2 \times 1} \] Computing the numerator: \( 48 \times 47 = 2256 \), then \( 2256 \times 46 = 103776 \), then \( 103776 \times 45 = 4669920 \). Dividing by \( 24 \): \[ {}^{48}C_{4} = \frac{4669920}{24} = 194580 \] Step 3: Multiply the two results. \[ \text{Total combinations} = {}^{4}C_{2} \times {}^{48}C_{4} = 6 \times 194580 = 1167480 \]

Answer: 1,167,480

Example 2

Question: From a standard deck of 52 cards, find the number of ways to select a hand of 7 cards that contains exactly 3 queens.

Solution: A standard deck has 4 queens and 48 non-queen cards. We need exactly 3 queens from the 4 queens, and the remaining 4 cards from the 48 non-queen cards. Step 1: Choose 3 queens from 4 queens. \[ {}^{4}C_{3} = \frac{4!}{3! \cdot 1!} = 4 \] Step 2: Choose 4 cards from the remaining 48 non-queen cards. \[ {}^{48}C_{4} = \frac{48 \times 47 \times 46 \times 45}{4!} \] Computing the numerator: \( 48 \times 47 = 2256 \), then \( 2256 \times 46 = 103776 \), then \( 103776 \times 45 = 4669920 \). Dividing by \( 4! = 24 \): \[ {}^{48}C_{4} = \frac{4669920}{24} = 194580 \] Step 3: Multiply the two results. \[ \text{Total combinations} = {}^{4}C_{3} \times {}^{48}C_{4} = 4 \times 194580 = 778320 \]

Answer: 778,320

🎯 Try a Similar Question

Try a Similar Question

Question: Determine the number of 6-card combinations from a standard deck of 52 cards such that each selection of 6 cards contains exactly one ace.

Solution

  1. Step 1: Understand the Structure of the Deck: A standard deck has 52 cards. Among these, there are 4 aces and the remaining \( 52 - 4 = 48 \) non-ace cards.
  2. Step 2: Set Up the Selection: We need to select 6 cards such that exactly one is an ace. So we must choose exactly 1 ace from the 4 available aces, and the remaining \( 6 - 1 = 5 \) cards must be chosen from the 48 non-ace cards.
  3. Step 3: Count Ways to Choose the Ace: The number of ways to choose exactly 1 ace from 4 aces is \( {}^{4}C_{1} \).
  4. Step 4: Count Ways to Choose the Remaining 5 Cards: The number of ways to choose 5 non-ace cards from the 48 non-ace cards is \( {}^{48}C_{5} \).
  5. Step 5: Apply the Multiplication Principle: By the fundamental principle of counting, the total number of 6-card combinations with exactly one ace is \( {}^{4}C_{1} \times {}^{48}C_{5} \).
  6. Step 6: Compute the Values: We have \( {}^{4}C_{1} = 4 \). Now compute \( {}^{48}C_{5} \): \[ {}^{48}C_{5} = \frac{48!}{5! \times 43!} = \frac{48 \times 47 \times 46 \times 45 \times 44}{5 \times 4 \times 3 \times 2 \times 1} \] Calculating the numerator: \( 48 \times 47 = 2256 \), then \( 2256 \times 46 = 103776 \), then \( 103776 \times 45 = 4669920 \), then \( 4669920 \times 44 = 205476480 \). The denominator is \( 120 \). Therefore \[ {}^{48}C_{5} = \frac{205476480}{120} = 1712304 \]
  7. Step 7: Final Calculation: Total combinations \[ = {}^{4}C_{1} \times {}^{48}C_{5} = 4 \times 1712304 = 6849216 \]

Answer: The number of 6-card combinations having exactly one ace is \( {}^{4}C_{1} \times {}^{48}C_{5} = 4 \times 1712304 = 6849216 \).

Everything you get with Solver7

More questions in Permutations and Combinations