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

Six '$+$' and four '$-$' signs are to be placed in a straight line so that no two '$-$' signs come together. Then the total number of ways is:

$^nC_r + ^nC_{r-1}$ is equal to

The product of any $r$ consecutive natural numbers is always divisible by

$A$ student has to answer $10$ out of $13$ questions in an examination,choosing at least $5$ questions from the first $6$ questions. The number of choices available to the student is:

$A$ student has to answer $10$ questions,choosing at least $4$ from each of the parts $A$ and $B$. If there are $6$ questions in part $A$ and $7$ in part $B$,then the number of ways the student can choose $10$ questions is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module