Math July 13, 2026 · 8 Min Read

Subset Calculator – Guide & Formulas

Generate all subsets of a set or find subsets of a specific size. Enter elements to list every subset systematically with count and cardinality breakdown.

Try the free calculator

Put these formulas into practice with our instant, step-by-step Subset Calculator.

Open Calculator ›

Use our free **Subset Calculator** to **find all subsets** of any set instantly. This **power set generator** helps you **list every subset** systematically or find **subsets of a specific size k** with step-by-step results. Whether you need to **count subsets** or **generate combinations**, this tool provides accurate results. Features include **organized output by size**, **C(n,k) breakdown**, and **empty set inclusion**. 100% free — no signup required!

Key Takeaway

Use the free Subset Calculator to generate all subsets of a set or find subsets of a specific size. enter elements to list every subset systematically with count and cardinality breakdown. Get instant results with step-by-step explanations.

How to Use the Subset Calculator

  1. Step 1: Enter the **set elements** separated by commas (e.g., 1, 2, 3, 4 or a, b, c) into the subset calculator.
  2. Step 2: Optionally enter **k** to find only subsets of a specific size using the subset of size k calculator.
  3. Step 3: Click Calculate to generate the **complete power set** with all possible subsets.
  4. Step 4: Review all **subsets organized by size** from the empty set (size 0) to the full set (size n).
  5. Step 5: Check the **total subset count** (2ⁿ) and the **C(n,k) breakdown** for each subset size.
  6. Step 6: Verify specific subsets using the **combinations formula** to confirm the count is correct.
  7. Step 7: Use the step-by-step breakdown to understand how the **power set generator** systematically creates each subset.

The Formula

The number of subsets of size k from an n-element set is C(n,k) = n! / (k!(n-k)!). The total number of subsets (power set size) is 2ⁿ. Each element is either included or excluded from a subset.

Variable Definitions

  • n: Total number of elements in the set
  • k: Desired size (cardinality) of subsets
  • C(n,k): Binomial coefficient: number of ways to choose k elements from n
  • 2ⁿ: Total number of subsets in the power set
  • n!: Factorial: n × (n-1) × ... × 1

Finding all subsets of {1, 2, 3}

Generate the complete subset list for a 3-element set.

  1. Step 1: n = 3 elements, total subsets = 2³ = 8.
  2. Step 2: Size 0 (C(3,0) = 1): { } (empty set).
  3. Step 3: Size 1 (C(3,1) = 3): {1}, {2}, {3}.
  4. Step 4: Size 2 (C(3,2) = 3): {1,2}, {1,3}, {2,3}.
  5. Step 5: Size 3 (C(3,3) = 1): {1,2,3}. Total: 1 + 3 + 3 + 1 = 8 subsets.

Frequently Asked Questions

What is a subset?

A subset is a set whose every element is also an element of another set. For set A = {1,2,3}, the subsets include {1}, {1,2}, {1,2,3}, and the empty set {}. Every set has itself and the empty set as subsets.

How many subsets does a set with n elements have?

A set with n elements has exactly 2ⁿ subsets. This is because each element has 2 choices: either included or excluded. With n elements, there are 2 × 2 × ... × 2 = 2ⁿ total combinations.

What is a subset of size k?

A subset of size k contains exactly k elements. The number of such subsets is given by the binomial coefficient C(n,k) = n!/(k!(n-k)!). For example, C(4,2) = 6 means there are 6 subsets of size 2 in a 4-element set.

Is the empty set a subset?

Yes. The empty set {} is a subset of every set. It corresponds to the case where no elements are chosen. There is always exactly 1 empty subset.

Is the set itself a subset?

Yes. Every set is a subset of itself. It corresponds to choosing all n elements. There is always exactly 1 such subset.

What is the difference between subset and proper subset?

A subset A ⊆ B means every element of A is in B (A can equal B). A proper subset A ⊂ B means A ⊆ B but A ≠ B. The number of proper subsets is 2ⁿ - 1 (excluding the set itself).

How do I list subsets systematically?

Use binary counting: assign each element a bit position. 000 = empty set, 001 = {element 3}, 010 = {element 2}, 011 = {element 2,3}, etc. This ensures no subset is missed.

What are applications of subsets?

Subsets are fundamental in probability (event spaces), combinatorics (counting), database theory (query optimization), machine learning (feature selection), and logic (propositional combinations).

How do I use the power set generator for my homework?

Enter your set elements separated by commas, and the power set generator will list all subsets. You can filter by size k to focus on subsets with a specific number of elements.

What is the difference between subsets and combinations?

A subset is any collection of elements from a set, while a combination specifically refers to choosing k elements from n. The number of subsets of size k equals the combination C(n,k).