Every set hides an explosion: a set of 4 elements quietly contains 16 subsets, a set of 10 contains 1,024, and a set of 30 contains over a billion. This subset calculator takes your set — typed as elements or just counted — and returns the number of subsets, the number of proper subsets, and, for small sets, the complete list of every subset it contains: the full power set, generated in order.
The Subset Rule: 2 to the n
A set with n elements has exactly 2ⁿ subsets. The reason is one clean idea: building a subset means walking down the element list and answering one yes-no question per element — in or out. Independent binary choices multiply: 2 × 2 × … × 2, n times. Four elements: 2⁴ = 16 subsets, from the empty set through every singleton and pair up to the full set itself. This calculator counts them instantly for any n and lists them while the list is printable (n up to 10, at most 1,024 entries).
Subsets vs Proper Subsets
A subset may equal the whole set; a proper subset must be strictly smaller. So proper subsets number 2ⁿ − 1 — remove the single case of the set itself. (A stricter "nonempty proper subset" count, sometimes asked, removes the empty set too: 2ⁿ − 2.) The empty set confuses students twice over: it is a subset of every set — vacuously, since it contains no element that could fail the test — and it is counted in every power set.
Worked Example: {A, B, C, D}
Four elements give 2⁴ = 16 subsets: the empty set; 4 singletons {A}, {B}, {C}, {D}; 6 pairs {A,B}, {A,C}, {A,D}, {B,C}, {B,D}, {C,D}; 4 triples; and the full set {A,B,C,D}. Count them by size and a famous row appears — 1, 4, 6, 4, 1 — Pascal's triangle, because the number of subsets of size k is the combination C(n, k), and the row sums to 2ⁿ. Proper subsets: 15. The calculator's list for this set shows all sixteen in binary-counting order, each element flickering in and out like a digit.
Subsets of Each Size: The Combination Connection
Asking "how many subsets have exactly k elements" converts the subset question into combinations: C(n, k) = n! ÷ (k!(n−k)!). For n = 10, the sizes split 1, 10, 45, 120, 210, 252, 210, 120, 45, 10, 1 — summing to 2¹⁰ = 1,024. The middle size is always the most numerous, and the symmetry C(n, k) = C(n, n−k) mirrors the fact that choosing what is in a subset simultaneously chooses what is out of it.
Where Subset Counting Runs the World
Every on/off system is a power set: a row of n light switches has 2ⁿ states, a permissions system with n independent flags grants 2ⁿ combinations, a pizza menu with n optional toppings offers 2ⁿ pizzas (a fact menus exploit and this calculator verifies for your local slice count). In probability, an event's sample space decomposes into subsets; in computer science, the subset-sum problem — does any subset total exactly T? — is a founding example of NP-completeness, hard precisely because the candidate list explodes as 2ⁿ.
Common Mistakes
Forgetting the empty set is the most common undercount — it is always there. Treating duplicates in the input as distinct elements is the second: a set {A, A, B} is really {A, B} with 4 subsets, not 8. Confusing subsets with permutations rounds out the trio: order does not matter inside a set, so {A, B} and {B, A} are one subset, not two — arrangements belong to the permutation family, counts to this one.
Reading the List: Binary Order
The calculator lists subsets by counting in binary: element 1 flickers fastest, element 2 half as often, and so on, so the subsets appear in the same order as the numbers 0 through 2ⁿ − 1 with each bit read as in-or-out. That ordering is more than tidiness — it is how computers enumerate power sets in practice, and it guarantees the list is complete: if the count of printed subsets equals 2ⁿ and no ordering repeats, nothing was missed and nothing was doubled.
Related Tools
The Power Set Calculator is this tool's sibling in the Math Calculators hub, where you will also find the Combination Calculator for the subsets-of-size-k question.
Frequently Asked Questions
How many subsets does a set with 4 elements have?
2 to the 4th power = 16, including the empty set and the set itself. Proper subsets: 15. This page's worked example lists all sixteen.
How do you calculate the number of subsets?
Raise 2 to the number of elements: subsets = 2^n. Each element independently is either in or out of a subset, giving n binary choices that multiply.
What is the difference between a subset and a proper subset?
A proper subset must be strictly smaller than the set; a subset may equal it. That single case is the whole difference: 2^n subsets versus 2^n − 1 proper subsets.
Is the empty set a subset of every set?
Yes. A subset fails only if it contains an element the parent set lacks; the empty set contains nothing, so it can never fail. It appears in every power set, including the power set of the empty set itself (which has exactly 1 subset).
How many subsets have exactly 3 elements from a set of 7?
C(7, 3) = 35. Subsets of a fixed size are combinations — order within the subset does not matter — while all sizes together total 2^7 = 128.
What is a power set?
The set of all subsets of a set — the collection this calculator lists. Its size is 2^n, and it is written P(S) or 2^S, notation that comes straight from the counting rule.
Why does the calculator stop listing at 10 elements?
Because 2^11 is already 2,048 entries and growth is merciless — 2^30 passes a billion. The count stays exact for any n; only the printing stops.