For a scholarship,at most n candidates out of | vedclass

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

Question

(B) The number of ways to select at least one candidate is given by $\sum_{k=1}^{n} {^{2n+1}C_k} = 63$. We know that $\sum_{k=0}^{2n+1} {^{2n+1}C_k} =

Vedclass · Accepted Answer

$3$

Vedclass · Answer

(B) The number of ways to select at least one candidate is given by $\sum_{k=1}^{n} {^{2n+1}C_k} = 63$. We know that $\sum_{k=0}^{2n+1} {^{2n+1}C_k} = 2^{2n+1}$. Since ${^{2n+1}C_k} = {^{2n+1}C_{2n+1-k}}$,we have $\sum_{k=0}^{n} {^{2n+1}C_k} = \sum_{k=n+1}^{2n+1} {^{2n+1}C_k} = \frac{2^{2n+1}}{2} = 2^{2n}$. Thus,$\sum_{k=1}^{n} {^{2n+1}C_k} = (\sum_{k=0}^{n} {^{2n+1}C_k}) - {^{2n+1}C_0} = 2^{2n} - 1$. Given $2^{2n} - 1 = 63$,we get $2^{2n} = 64 = 2^6$. Therefore,$2n = 6$,which implies $n = 3$. The maximum number of candidates that can be selected is $n = 3$.

For a scholarship,at most $n$ candidates out of $2n+1$ can be selected. If the number of different ways of selecting at least one candidate for the scholarship is $63$,then the maximum number of candidates that can be selected for the scholarship is -

Similar Questions

If $^8C_r = ^8C_{r+2}$,then the value of $^rC_2$ is

$A$ question paper consists of two sections having $3$ and $4$ questions respectively. The following note is given on the paper: "It is not necessary to attempt all the questions. One question from each section is compulsory". In how many ways can a candidate select the questions?

In how many ways can a group of $7$ persons be formed from $6$ boys and $4$ girls such that the boys are in the majority?

The number of ways to distribute $25$ identical apples among $4$ boys,such that each boy receives at least $4$ apples,is

In how many ways can a team of $10$ players be selected from $22$ players if $6$ particular players are always to be included and $4$ particular players are always excluded?

Vedclass Test Series

Exam Paper Generator

Online Exam Module