A set contains 2n + 1 elements. The number of | vedclass

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

Question

(d) Let the original set contains $(2n + 1)$ elements, then subsets of this set containing more than $n$ elements, i.e., subsets containing $(n + 1)$

Vedclass · Accepted Answer

${2^{2n}}$

Vedclass · Answer

(d) Let the original set contains $(2n + 1)$ elements, then subsets of this set containing more than $n$ elements, i.e., subsets containing $(n + 1)$ elements, $(n + 2)$ elements, &hellip;&hellip;. $(2n + 1)$ elements.

$	herefore$ Required number of subsets

$ = {\,^{2n + 1}}{C_{n + 1}} + {\,^{2n + 1}}{C_{n + 2}} + .... + {\,^{2n + 1}}{C_{2n}} + {\,^{2n + 1}}{C_{2n + 1}}$

$ = {\,^{2n + 1}}{C_n} + {\,^{2n + 1}}{C_{n - 1}} + ... + {\,^{2n + 1}}{C_1} + {\,^{2n + 1}}{C_0}$

$ = {\,^{2n + 1}}{C_0} + {\,^{2n + 1}}{C_1} + {\,^{2n + 1}}{C_2} + ... + {\,^{2n + 1}}{C_{n - 1}} + {\,^{2n + 1}}{C_n}$

$ = {1 \over 2}\left[ {{{(1 + 1)}^{2n + 1}}} ight]$$ = {1 \over 2}[{2^{2n + 1}}] = {2^{2n}}$.

A set contains $2n + 1$ elements. The number of subsets of this set containing more than $n$ elements is equal to

Similar Questions

How many words, with or without meaning, can be formed using all the letters of the word $\mathrm{EQUATION}$ at a time so that the vowels and consonants occur together?

$^n{C_r}{ + ^n}{C_{r - 1}}$ is equal to

Determine the number of $5$ card combinations out of a deck of $52$ cards if there is exactly one ace in each combination.

The number of ways in which thirty five apples can be distributed among $3$ boys so that each can have any number of apples, is

The number of ordered pairs ( $\mathrm{r}, \mathrm{k}$ ) for which $6 \cdot ^{35} \mathrm{C}_{\mathrm{r}}=\left(\mathrm{k}^{2}-3\right)\cdot{^{36} \mathrm{C}_{\mathrm{r}+1}}$. where $\mathrm{k}$ is an integer, is