SOLVER7 Study. Nothing Else.
Exercise 6.4 Q6

Determine the number of \(5\) card combinations out of a deck of \(52\) cards if there is exactly one ace in each combination.

CBSE Class 11 Maths · Permutations and Combinations

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have a big box of 52 playing cards. Inside, 4 cards are special — they are called aces. You want to pick 5 cards, but only 1 of those 5 can be an ace. Count the ways to pick exactly 1 ace from the 4 aces. Count the ways to pick the other 4 cards from the 48 non-ace cards. Multiply those two counts together to get the total number of different 5-card hands with exactly one ace.

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

📖 5-Card Combinations with Exactly One Ace

Detailed Explanation

A standard deck has \( 52 \) cards, out of which \( 4 \) are aces and the remaining \( 48 \) are non-ace cards. Since the order in which we pick the cards does not matter (a hand is just a group of cards), we use combinations, not permutations. The phrase 'exactly one ace' means our 5-card hand must contain one ace and four non-ace cards. To build such a hand we make two independent choices: first choose which ace to include, then choose the four remaining cards from the non-aces. By the fundamental principle of counting, we multiply the number of ways of each choice.

Formula Used

The number of ways to choose \( r \) objects from \( n \) is \[ {}^{n}C_{r} = \frac{n!}{r!\,(n-r)!} \] Total ways = (ways to choose the ace) \( \times \) (ways to choose the non-aces).

Solution

  1. Step 1: Split the deck into two groups. There are \( 4 \) aces and \( 52 - 4 = 48 \) non-ace cards. A hand with exactly one ace must contain \( 1 \) ace and \( 4 \) non-ace cards.
  2. Step 2: Choose the single ace. The number of ways to pick \( 1 \) ace from \( 4 \) aces is \[ {}^{4}C_{1} = 4 \]
  3. Step 3: Choose the four non-ace cards from the \( 48 \) non-aces. The number of ways is \[ {}^{48}C_{4} = \frac{48!}{4!\,44!} = \frac{48 \times 47 \times 46 \times 45}{4 \times 3 \times 2 \times 1} \]
  4. Step 4: Simplify the value of \( {}^{48}C_{4} \). The numerator is \[ 48 \times 47 \times 46 \times 45 = 4669920 \] and the denominator is \( 24 \), so \[ {}^{48}C_{4} = \frac{4669920}{24} = 194580 \]
  5. Step 5: Apply the multiplication principle. Since choosing the ace and choosing the non-aces are independent, multiply the results: \[ 4 \times 194580 = 778320 \]

Final Answer

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

Common Mistake

A common mistake is choosing the remaining 4 cards from all \( 51 \) leftover cards instead of only the \( 48 \) non-aces. This would allow a second ace to sneak in, violating the 'exactly one ace' condition.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Partition the deck into aces and non-aces. A standard deck has 52 cards total. Of these, 4 are aces and the rest are non-aces: \[52 - 4 = 48 \text{ non-ace cards}\] Reason: Separating the deck into two distinct groups lets us handle the 'exactly one ace' condition cleanly by treating each group independently.
  2. Step 2: State the hand composition. A 5-card hand with exactly one ace must contain 1 ace and 4 non-ace cards, since \(1 + 4 = 5\). Reason: The phrase 'exactly one ace' fixes the count of aces at 1, which automatically fixes the non-ace count at 4 to complete the 5-card hand.
  3. Step 3: Count the ways to select the single ace from the 4 available aces: \[{}^{4}C_{1} = \frac{4!}{1!\,3!} = 4\] Reason: Any one of the 4 aces can fill the single ace slot, giving 4 possibilities.
  4. Step 4: Set up the combination for choosing 4 non-ace cards from the 48 non-aces: \[{}^{48}C_{4} = \frac{48!}{4!\,44!} = \frac{48 \times 47 \times 46 \times 45}{4 \times 3 \times 2 \times 1}\] Reason: Only the top 4 factors of 48! survive after cancellation with 44!, keeping the arithmetic manageable.
  5. Step 5: Compute the numerator and denominator separately. Numerator: \[48 \times 47 \times 46 \times 45 = 4{,}669{,}920\] Denominator: \[4 \times 3 \times 2 \times 1 = 24\] Therefore: \[{}^{48}C_{4} = \frac{4{,}669{,}920}{24} = 194{,}580\] Reason: Breaking the multiplication into two separate calculations reduces the chance of arithmetic errors.
  6. Step 6: Multiply the two independent choices together using the Fundamental Principle of Counting: \[{}^{4}C_{1} \times {}^{48}C_{4} = 4 \times 194{,}580 = 778{,}320\] Reason: Since choosing the ace and choosing the non-ace cards are independent decisions, the total number of valid hands is the product of the two counts.

Final Answer

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

Common Mistake

One common mistake: students subtract instead of multiply — they write \({}^{4}C_{1} + {}^{48}C_{4}\) instead of \({}^{4}C_{1} \times {}^{48}C_{4}\). The Fundamental Principle of Counting requires multiplication when two independent choices are made simultaneously.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Deck split: 4 aces, 48 non-aces. Hand requires 1 ace + 4 non-aces.
  2. Step 2: Ways to choose 1 ace from 4: \[ {}^{4}C_{1} = 4 \]
  3. Step 3: Ways to choose 4 non-aces from 48: \[ {}^{48}C_{4} = \frac{48 \times 47 \times 46 \times 45}{4 \times 3 \times 2 \times 1} = \frac{4669920}{24} = 194580 \]
  4. Step 4: \[ {}^{4}C_{1} \times {}^{48}C_{4} = 4 \times 194580 = 778320 \]

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

➕ More Examples

More Examples

Example 1

Question: Find the number of 6-card combinations that can be formed from a standard deck of 52 cards such that each combination contains exactly 2 kings.

Solution: A standard deck has 4 kings and 48 non-king cards. Step 1: Choose exactly 2 kings from the 4 available kings. Number of ways = \( {}^{4}C_{2} \) \[ {}^{4}C_{2} = \frac{4!}{2! \cdot 2!} = \frac{4 \times 3}{2 \times 1} = 6 \] Step 2: Choose the remaining \( 6 - 2 = 4 \) cards from the 48 non-king cards. Number of ways = \( {}^{48}C_{4} \) \[ {}^{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 \). Denominator: \( 4! = 24 \). \[ {}^{48}C_{4} = \frac{4669920}{24} = 194580 \] Step 3: Multiply the two results to get the total number of combinations. \[ \text{Total} = {}^{4}C_{2} \times {}^{48}C_{4} = 6 \times 194580 = 1167480 \]

Answer: 1,167,480

Example 2

Question: A bag contains 5 red balls and 11 blue balls. In how many ways can 4 balls be selected so that exactly 3 of them are red?

Solution: The bag has 5 red balls and 11 blue balls, making 16 balls in total. Step 1: Choose exactly 3 red balls from the 5 red balls available. Number of ways = \( {}^{5}C_{3} \) \[ {}^{5}C_{3} = \frac{5!}{3! \cdot 2!} = \frac{5 \times 4}{2 \times 1} = 10 \] Step 2: Choose the remaining \( 4 - 3 = 1 \) ball from the 11 blue balls. Number of ways = \( {}^{11}C_{1} \) \[ {}^{11}C_{1} = 11 \] Step 3: Multiply the two results to get the total number of selections. \[ \text{Total} = {}^{5}C_{3} \times {}^{11}C_{1} = 10 \times 11 = 110 \]

Answer: 110

🎯 Try a Similar Question

Try a Similar Question

Question: A standard deck of 52 playing cards contains 4 kings. Find the number of 6-card combinations that contain exactly 2 kings.

Solution

  1. Step 1: Identify the groups: A standard deck has 52 cards, of which 4 are kings and the remaining \( 52 - 4 = 48 \) are non-kings. We need to form a 6-card hand with exactly 2 kings.
  2. Step 2: Choose exactly 2 kings from the 4 kings: The number of ways to select exactly 2 kings from the 4 available kings is \( {}^{4}C_{2} \).
  3. Step 3: Choose the remaining 4 cards from the 48 non-kings: Since the hand has 6 cards and 2 are already kings, we need \( 6 - 2 = 4 \) more cards chosen from the 48 non-king cards. The number of ways to do this is \( {}^{48}C_{4} \).
  4. Step 4: Compute each combination: First, compute \( {}^{4}C_{2} \): \[ {}^{4}C_{2} = \frac{4!}{2! \times 2!} = \frac{4 \times 3}{2 \times 1} = 6 \] Next, compute \( {}^{48}C_{4} \): \[ {}^{48}C_{4} = \frac{48!}{4! \times 44!} = \frac{48 \times 47 \times 46 \times 45}{4 \times 3 \times 2 \times 1} \] The numerator is \( 48 \times 47 \times 46 \times 45 = 4669920 \) and the denominator is \( 24 \), so \[ {}^{48}C_{4} = \frac{4669920}{24} = 194580 \]
  5. Step 5: Apply the multiplication principle: By the fundamental principle of counting, the total number of 6-card combinations with exactly 2 kings is \[ {}^{4}C_{2} \times {}^{48}C_{4} = 6 \times 194580 = 1167480 \]

Answer: The number of 6-card combinations with exactly 2 kings is \( {}^{4}C_{2} \times {}^{48}C_{4} = 6 \times 194580 = 1167480 \).

Everything you get with Solver7

More questions in Permutations and Combinations