At an election, a voter may vote for any number of candidates, not greater than the number to be elected. There are 10 candidates and 4 are of be elected. If a voter votes for at least one candidate, then the number of ways in which he can vote is
To cast a vote, the voter may choose any non-empty subset of the 10 candidates, with the restriction that the subset can contain at most 4 names because only 4 candidates are to be elected.
Therefore, the voter can select:
• exactly 1 candidate, or
• exactly 2 candidates, or
• exactly 3 candidates, or
• exactly 4 candidates.
The number of ways to choose candidates out of 10 is the combination . Hence, the required total number of voting patterns is
Compute each term:
Add the results:
Hence, the voter has 385 different ways to cast a valid vote.
Option C which is: 385
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.