Home
Class 11
MATHS
Prove that the number of all subsets of ...

Prove that the number of all subsets of a finite set of n element is `2^(n)`.

Promotional Banner

Topper's Solved these Questions

  • SAMPLE QUESTION PAPER -2

    OMEGA PUBLICATION|Exercise Section - C (4 MARK) |16 Videos

  • SAMPLE QUESTION PAPER -2

    OMEGA PUBLICATION|Exercise Section - D (6 MARK) |5 Videos

  • SAMPLE QUESTION PAPER -2

    OMEGA PUBLICATION|Exercise Section - D (6 MARK) |5 Videos

  • SAMPLE QUESTION PAPER -1 (PUNJAB)

    OMEGA PUBLICATION|Exercise SECTION - D|6 Videos

  • SAMPLE QUESTION PAPER -3

    OMEGA PUBLICATION|Exercise Section D (6 MARK) |6 Videos

Similar Questions

Explore conceptually related problems

The number of subsets of the set{1,2,4} is:

The number of subsets of the set {a, b} is :

The number of subsets of the set {1, 2, 3} is:

Prove, by Induction, that the number of all the subsets of a set containing n distinct elements, is 2^n .

Let A and B be too sets containing four and two elements respectively then the number of subsets of set AxxB having atleast 3 elements is

What is the total number of proper subsets of a set containing n elements ?

The number of subsets of the set (a, e, i, o, u} is:

The total number of subsets of a finite set A has 56 more elements then the total number of subsets of another finite set B. What is the number of elements in the set A ?