$A$ set contains $(2n + 1)$ elements. The number of subsets of the set which contain at most $n$ elements is:

  • A
    $2^{2n-1}$
  • B
    $2^{2n}$
  • C
    $2^{n}$
  • D
    $2^{n+1}$

Explore More

Similar Questions

At an election,a voter may vote for any number of candidates not exceeding the number to be elected. If $4$ candidates are to be elected out of the $12$ contested in the election and a voter votes for at least one candidate,then the number of ways in which a voter can vote is:

If $^nC_{r-1} = 36$,$^nC_r = 84$,and $^nC_{r+1} = 126$,then the value of $r$ is

Let $N$ be the set of positive integers. The number of distinct triplets $(x, y, z)$ satisfying $x, y, z \in N, x < y < z$ and $x+y+z=12$ is

In how many ways can one select a cricket team of $11$ from $17$ players in which only $5$ players can bowl,if each cricket team of $11$ must include exactly $4$ bowlers?

The number of non-negative integral solutions of $x_1+x_2+x_3+x_4=10$ is

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo