Subset calculator
Count every subset, proper subset, and size-specific combination from either a concrete set or its cardinality.
Inputs
Enter 1 – 10 distinct numbers separated by commas. Scientific notation and decimal commas are not accepted.
Required whole number from 0 to 52.
Optional whole number from 0 to n.
Results
Total subsets
16
Every element has two choices: included or excluded.
2⁴ = 16 total subsets; 2⁴ – 1 = 15 proper subsets.
A set with 4 elements has 16 subsets and 15 proper subsets.
Subsets by cardinality
Each bar is the binomial coefficient C(n, k), the number of subsets containing exactly k elements.
The distribution is symmetric: choosing k elements is equivalent in count to excluding k elements from the opposite side.
Cardinality distribution
| Subset size (k) | Number of subsets C(n, k) | Share of all subsets |
|---|
The row counts add to the total number of subsets. For n = 4, the sequence 1, 4, 6, 4, 1 is the fourth row of Pascal's triangle.
Generated subset list
| # | Cardinality | Subset |
|---|
The empty set is written as ∅. The list is grouped from cardinality 0 through n and is available only when actual set elements are supplied.
How to use this subset calculator
What this calculator does
This calculator counts the subsets of a finite set and, when you provide actual numeric elements, can generate the full power set. It reports the total number of subsets, the number of proper subsets, and the number of subsets at each possible cardinality. It also identifies the largest cardinality layer and can answer a specific “n choose k” question. The calculation is an exact combinatorial identity for finite sets with distinct elements; it does not estimate probability, determine whether two differently written real-world objects are logically identical, or analyze infinite sets.
When to use it
Use it when checking a set-theory exercise, counting all possible feature combinations, finding how many teams of a given size can be selected, or studying the coefficients in Pascal's triangle. It is also useful for verifying that a manually written power set contains the empty set, the original set, and every intermediate-sized subset exactly once. OpenStax's explanation of subsets, proper subsets, and the 2ⁿ rule provides a helpful conceptual reference.
How to calculate
- The calculator opens with the ready-to-use set {2, 4, 6, 8}. Its 16 subsets, 15 proper subsets, distribution table, chart, and validated example XLSX are available immediately.
- Choose Set elements when you know the members of the set. Replace the demonstration numbers in Set elements with 1 – 10 distinct numbers separated by commas. Keep Display subset list selected to generate every subset, or clear it when you only need counts.
- Choose Set cardinality when you know only how many elements the set contains. Enter a whole number in Set cardinality. Optionally enter Subset cardinality (k) to calculate the number of subsets containing exactly k elements.
- Read Total subsets first, then compare Proper subsets, the Largest layer, the chart, and the distribution table. The generated list appears only in element mode when its checkbox is selected.
- Select Download Excel to export the current validated inputs, outputs, distribution, and generated subsets as a real XLSX workbook. Reset clears the demonstration and all data fields; the export is then disabled until you enter a complete valid state again.
Input guide
What do you know? is the required mode control. Choose Set elements for an explicit finite set or Set cardinality for count-only work. Switching modes changes which fields drive the model; it does not convert a list into an unrelated cardinality value.
Set elements is required in element mode. Enter 1 – 10 distinct ordinary decimal numbers, such as -3, 0, 2.5, 8. Commas separate elements, so a decimal comma such as 1,5 means two elements rather than 1.5; use a period for decimals. Scientific notation, repeated values, empty entries between commas, and values outside the documented range are rejected. Adding one distinct element doubles the total subset count.
Display subset list is an optional checkbox in element mode. Selecting it produces every subset, including ∅ and the full set. It changes only the detail output, not the counts. With ten elements the list has 1,024 rows, so clear the box when you need a compact result.
Set cardinality is required in cardinality mode and accepts a whole number from 0 through 52, for example 12. Zero is valid: the empty set has one subset and no proper subsets. Fractions, signs, grouping marks, and scientific notation are rejected. Each increase of one in n doubles Total subsets.
Subset cardinality (k) is optional and accepts a whole number from 0 through n, for example 3 when n = 8. It asks how many subsets have exactly k elements. Leaving it blank keeps the full distribution but omits the selected-k result. A common mistake is entering k larger than n, which is impossible and therefore invalid.
Output guide
Total subsets is the exact value 2ⁿ and includes both ∅ and the original set. Proper subsets is exactly one less because the original set is the only subset that is not proper. Set cardinality is the number n of distinct elements. Largest layer reports the most numerous subset size, normally near n/2, and its count. Middle-sized subsets in element mode shows that same central layer; in cardinality mode it becomes Subsets with k elements when k is supplied.
The Subsets by cardinality chart compares C(n, k) across subset sizes when n is small enough for legible bars. The Cardinality distribution table gives the exact k, count, and percentage share for every layer; its counts sum to Total subsets. The Generated subset list gives a sequence number, cardinality, and literal subset. Zero counts do not occur for valid k between 0 and n; symmetry means C(n, k) = C(n, n – k).
Worked example
For the startup set {2, 4, 6, 8}, n = 4. Each of the four elements can be included or excluded, so the total is 2⁴ = 16. The proper-subset count is 16 – 1 = 15. The size-two layer is C(4, 2) = 4! ÷ (2! × 2!) = 6, which is why the central bar and table row show 6. The complete distribution is 1, 4, 6, 4, 1, and those values add back to 16.
How the formulas work
A subset is formed by making one binary decision for every element: include it or exclude it. With n independent decisions and two choices per decision, the multiplication principle gives 2 × 2 × ... × 2 = 2ⁿ possibilities. The empty set corresponds to excluding every element, while the original set corresponds to including every element. Removing that one full-set case gives 2ⁿ – 1 proper subsets.
For a fixed subset size k, order does not matter. The count is the binomial coefficient C(n, k) = n! ÷ (k!(n – k)!). The LibreTexts treatment of binomial coefficients explains why this same number counts k-element subsets, bit strings with k ones, and several other combinatorial structures. OpenStax also connects the multiplication principle, combinations, and subset counts in one sequence.
Interpretation and common mistakes
- Set elements must be distinct. Writing the same number twice does not create a larger set.
- The empty set is always included in the power set, even when the original set is empty.
- A proper subset may be empty, but it cannot equal the original set.
- The table percentages describe the distribution of all subsets by size; they are not probabilities unless every subset is assumed equally likely.
- The calculator limits n to 52 so every reported integer remains exact in browser arithmetic and in the XLSX workbook.