In an election,the number of candidates is 1 | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(C) Let the number of candidates be $n$. The number of persons to be elected is $n-1$.
A voter can vote for any number of candidates from $1$ to $n-1

Vedclass · Accepted Answer

$8$

Vedclass · Answer

(C) Let the number of candidates be $n$. The number of persons to be elected is $n-1$.
A voter can vote for any number of candidates from $1$ to $n-1$.
The total number of ways a voter can vote is:
$^nC_1 + {}^nC_2 + \cdots + {}^nC_{n-1} = 254$
We know that:
$\sum_{r=0}^{n} {}^nC_r = 2^n$
Therefore,
$^nC_0 + {}^nC_1 + {}^nC_2 + \cdots + {}^nC_{n-1} + {}^nC_n = 2^n$
Substituting the known values:
$1 + 254 + 1 = 2^n$
$256 = 2^n$
$2^8 = 2^n$
Thus, $n = 8$

In an election,the number of candidates is $1$ greater than the number of persons to be elected. If a voter can vote in $254$ ways,then the number of candidates is:

Similar Questions

How many $3$-digit odd numbers can be formed from the digits $1, 2, 3, 4, 5, 6$ when
$(i)$ repetition of digits is not allowed
(ii) repetition of digits is allowed?

How many three-digit numbers can be formed from the digits $2, 3, 5, 6, 7,$ and $9$ which are divisible by $5$,given that no digit is repeated?

$X, Y, Z$ are sets of all positive divisors of $10^{60}, 20^{50}$ and $30^{40}$ respectively. Find $n(X \cup Y \cup Z)$.

How many different four-letter words can be formed (the words need not be meaningful) using the letters of the word $MEDITERRANEAN$ such that the first letter is $E$ and the last letter is $R$?

$\sum_{0 \le i < j \le n} i \binom{n}{j}$ is equal to

Vedclass Test Series

Exam Paper Generator

Online Exam Module