The number of subsets of a set containin...

The number of subsets of a set containing n elements is

A

(a) `2^(n)`

B

(b) `n^(2) `

C

(c) ` 2n `

D

(d) ` n `

Verified by Experts

The correct Answer is:

A

Similar Questions

Explore conceptually related problems

The number of all subsets of a set containing 2n+1 elements which contains more than n elements is

If A={1,2,3,4}, then the number of subsets of set A containing element 3, is

Number of proper subsets of a set containing 4 elements is (i) 4^(2) (ii) 4^(2)-1 (iii) 2^(4) (iv) 2^(4)-1

Prove that the number of subsets of a set containing n distinct elements is 2^n for all ""n in N .

A set contains 2n+1 elements. The number of subsets of this set containing more than n elements :

The number of all possible subsets of a set containing n elements ?

The number of elements of the power set of a set containing n elements is

Two subsets A and B of a set containing n elements are chosen at random. The probability that A sube B is

Let A be a set containing ten elements. Then the number of subsets of A containing at least four elements is

A set contains (2n+1) elements. If the number of subsets of this set which contain atmost n elements is 4096, then n is