Power Set Calculator

Enter the elements of your set, separated by commas.

Up to 10 elements separated by commas. A repeated element counts once.

Try

Result

You entered{a,b,c}\{a, b, c\}

∅, {a}, {b}, {c}, {a,b}, {a,c}, {b,c}, {a,b,c}\displaystyle \varnothing,\ \{a\},\ \{b\},\ \{c\},\ \{a, b\},\ \{a, c\},\ \{b, c\},\ \{a, b, c\}

Number of subsets

23=8\displaystyle 2^{3} = 8

Proper subsets

7\displaystyle 7
Show the work
  1. Number of subsets

    Each of the n=3n = 3 elements is either in a subset or not, two choices each, so a set with nn elements has 2n2^n subsets, counting the empty set and the whole set.

    Using ∣P(S)∣=2n\left|\mathcal{P}(S)\right| = 2^{n}

    23=82^{3} = 8
  2. Counting subsets by size

    The subsets with kk elements are the ways to choose kk of the nn elements, and the sizes add up to every subset.

    (30)+(31)+(32)+(33)=1+3+3+1=8\begin{aligned} \binom{3}{0} + \binom{3}{1} + \binom{3}{2} + \binom{3}{3} &= 1 + 3 + 3 + 1 \\ &= 8 \end{aligned}
  3. Listing the subsets

    List them by size, from the empty set up to the whole set, and within one size in the order the elements were typed.

    P({a,b,c})={∅, {a}, {b}, {c}, {a,b}, {a,c}, {b,c}, {a,b,c}}\mathcal{P}\left(\{a, b, c\}\right) = \left\{\varnothing,\ \{a\},\ \{b\},\ \{c\},\ \{a, b\},\ \{a, c\},\ \{b, c\},\ \{a, b, c\}\right\}
  4. Result

    So the set has 88 subsets.

Worked examples