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

The number of words (with or without meaning) that can be formed from all the letters of the word $"LETTER"$ in which vowels never come together is

The number of matrices of order $3 \times 3$, whose entries are either $0$ or $1$ and the sum of all the entries is a prime number, is$....$

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

From a class of $25$ students, $10$ are to be chosen for an excursion party. There are $3$ students who decide that either all of them will join or none of them will join. In how many ways can the excursion party be chosen?