How this instrument works
A subset is any grouping built by picking some, all, or none of a set's elements, and the total number of distinct groupings follows a strikingly simple rule: total = 2ⁿ, where n is how many elements the original set holds. The reasoning is built one element at a time — each element independently faces exactly two possibilities, appearing in a particular grouping or not, and since every element's choice is made without regard to any other element's choice, the counts multiply rather than add. Two choices, repeated n times, multiply out to 2×2×⋯×2, which is 2ⁿ.
That total always counts two extremes that are easy to overlook: the empty grouping, formed by leaving out every single element, and the full grouping, formed by keeping every element in. Both are legitimate groupings by the ordinary definition, so a four-element set's 16 groupings include the empty one and the complete one right alongside the twelve mixed possibilities in between. Leaving either extreme out would undercount the true total.
A related but distinct figure sometimes gets asked for instead: the count of proper groupings, meaning every grouping except the full set itself. That figure is 2ⁿ−1, one less than the total this page reports, because it deliberately excludes the single case where nothing at all was left out. The two numbers are easy to confuse, so it's worth checking which one a problem is actually asking for before reading off an answer.
- Enter n, how many elements your set contains, into the Set size field.
- Read Number of subsets: the total count 2ⁿ, produced instantly from that single entry.
- Try n=0 to confirm the empty set's own lone grouping, or push n higher to watch the count double with every added element.
Worked example — grouping a four-element set
A set holding 4 elements offers each element two independent fates, kept or dropped, so the running product is 2×2×2×2=16 distinct groupings in total. That count of 16 already folds in the empty grouping, where every element was dropped, and the full set, where every element was kept, alongside the fourteen groupings that mix some kept elements with some dropped ones.
The rule holds at both extremes of size. A set with 0 elements has nothing to choose from at all, leaving exactly 2⁰=1 grouping, the empty set counted as its own single possibility. Push the other way to a 10-element set and the total reaches 2¹⁰=1024, a number that arrived by doubling once for every element beyond the first, showing just how quickly this count outpaces the size of the underlying set.
Questions
Why does a set with n elements have exactly 2ⁿ subsets?
Because every one of its elements can independently be kept or dropped when forming a grouping, giving two possibilities per element, and independent choices combine by multiplying rather than adding. Multiplying two possibilities together n separate times produces 2ⁿ distinct outcomes overall.
Does the total include the empty set and the full set itself?
Yes, both extremes count as legitimate groupings under the ordinary definition. A four-element set's 16 includes the single grouping where nothing was kept and the single grouping where everything was kept, alongside every mixed possibility sitting between those two ends.
Why does an empty set have exactly one grouping?
Because there's nothing to choose from at all, so only one possibility exists: the empty grouping itself. Plugging n=0 into 2ⁿ confirms it directly, since 2⁰ equals 1 regardless of what the underlying set contains.
What's the difference between the total count here and a proper-subset count?
The total this page reports, 2ⁿ, includes the complete set as one of its own groupings. A proper-subset count deliberately excludes that single case, leaving 2ⁿ−1 instead, so the two figures always differ by exactly one and answer subtly different questions.
How quickly does the subset count grow as n increases?
Extremely quickly, since each extra element doubles the previous total rather than merely adding to it. A set of 10 elements already reaches 1024 groupings, and each additional element beyond that pushes the count past twice its former size.