A student is allowed to select at most n book | vedclass

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

Question

(b) Since the student is allowed to select at most n books out of $(2n + 1)$ books, therefore in order to select one book he has the choice to select

Vedclass · Accepted Answer

$3$

Vedclass · Answer

(b) Since the student is allowed to select at most n books out of $(2n + 1)$ books, therefore in order to select one book he has the choice to select one, two, three, ......, $n$ books.

Thus, if $T$ is the total number of ways of selecting one book then $T = {\,^{2n + 1}}{C_1} + {\,^{2n + 1}}{C_2} + ... + {\,^{2n + 1}}{C_n} = 63$ &hellip;..$(i)$

Again the sum of binomial coefficients

$^{2n + 1}{C_0} + {\,^{2n + 1}}{C_1} + {\,^{2n + 1}}{C_2} + ..... + {\,^{2n + 1}}{C_n} + {\,^{2n + 1}}{C_{n + 1}}$

${ + ^{2n + 1}}{C_{n + 2}} + .... + {\,^{2n + 1}}{C_{2n + 1}} = {(1 + 1)^{2n + 1}} = {2^{2n + 1}}$

or $^{2n + 1}{C_0} + 2{(^{2n + 1}}{C_1} + {\,^{2n + 1}}{C_2} + .. + {\,^{2n + 1}}{C_n}){ + ^{2n + 1}}{C_{2n + 1}} = {2^{2n + 1}}$

==> $1 + 2(T) + 1 = {2^{2n + 1}}$ ==> $1 + T = \frac{{{2^{2n + 1}}}}{2} = {2^{2n}}$

==> $1 + 63 = {2^{2n}}$

$\Rightarrow {2^6} = {2^{2n}}$

$\Rightarrow n = 3$.

A student is allowed to select at most $n$ books from a collection of $(2n + 1)$ books. If the total number of ways in which he can select one book is $63$, then the value of $n$ is

Similar Questions

The total number of ways of selecting six coins out of $20$ one rupee coins, $10$ fifty paise coins and $7$ twenty five paise coins is

If $^{2017}C_0 + ^{2017}C_1 + ^{2017}C_2+......+ ^{2017}C_{1008} = \lambda ^2 (\lambda > 0),$ then remainder when $\lambda $ is divided by $33$ is-

Five balls of different colours are to be placed in three boxes of different sizes. Each box can hold all five balls. In how many ways can we place the balls so that no box remains empty

Statement$-1:$ The number of ways of distributing $10$ identical balls in $4$ distinct boxes such that no box is empty is $^9C_3 .$

Statement$-2:$ The number of ways of choosing any $3$ places from $9$ different places is $^9C_3 $.

How many words can be made from the letters of the word $BHARAT$ in which $ B $ and $H$ never come together