Question:

There are 10 cards numbered \(1\) to \(10\). The number of ways in which at least 3 cards can be chosen from these 10 cards is

Show Hint

For "at least" type counting problems, it is usually easier to count the total number of possibilities and subtract the unwanted cases.
Updated On: Jul 29, 2026
  • \(1023\)
  • \(1013\)
  • \(1024\)
  • \(968\)
Show Solution
collegedunia
Verified By Collegedunia

The Correct Option is D

Solution and Explanation

Concept: The total number of selections from \(n\) distinct objects is \(2^n\). To find the number of selections containing at least 3 objects, subtract the selections containing fewer than 3 objects.

Step 1: Find the total number of ways to choose cards. Since there are \(10\) distinct cards, \[ \text{Total selections} = 2^{10} = 1024. \]

Step 2: Find the number of selections containing fewer than 3 cards. Choosing \(0\) cards: \[ {10 \choose 0}=1. \] Choosing \(1\) card: \[ {10 \choose 1}=10. \] Choosing \(2\) cards: \[ {10 \choose 2}=45. \] Hence, \[ 1+10+45=56. \]

Step 3: Find the number of selections containing at least 3 cards. \[ 1024-56=968. \] Therefore, the required number of ways is \[ \boxed{968} \] \[ \boxed{\text{Answer = (D)}} \]
Was this answer helpful?
0
0