Home
Class 11
MATHS
Theorem 3 ( Total number of subset of a ...

Theorem 3 ( Total number of subset of a finite set containing n elements is `2^n`)

Text Solution

AI Generated Solution

Doubtnut Promotions Banner Mobile Dark
|

Similar Questions

Explore conceptually related problems

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

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

Knowledge Check

  • The total number of elements in the power set of a set A containing n elements is :

    A
    `n^(2)`
    B
    `2^(n)`
    C
    `2^(n) - 1`
    D
    none of these

  • The total number of elements in the power set of a set A containing n elements is :

    A
    `n^2`
    B
    `2^n`
    C
    `2^n-1`
    D
    none of these

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

    A
    `2^(n-1)`
    B
    `2^n`
    C
    `2^(n+1)`
    D
    `2^(2n)`

    • Similar Questions

    Explore conceptually related problems

    The number of proper subsets of a given finite set with 4 elements is

    The number of proper subsets of a given finite set with 4 elements is ……

    The number of subsets of set containing n distinct object is

    A set contsins (2n+1) elements. The number of subset of the set which contain at most n elements is

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

    Home
    Profile