Power Set Generator

Summary

Enter a set of elements and instantly see every possible subset, organized by size, with a total count.

How it works

1. Enter your elements in the input box, separated by commas (e.g. a, b, c).
2. Duplicate elements are automatically removed to keep the set valid.
3. The tool computes all 2ⁿ subsets using a bitmask enumeration algorithm.
4. Subsets are grouped by size — from the empty set (size 0) up to the full set (size n).
5. Use Copy to copy all subsets to your clipboard, or Download to save as a text file.

Use cases

• Enumerate all possible subsets for a combinatorics homework problem.
• Verify power set size (2ⁿ) when studying set theory.
• Generate all feature flag combinations for software configuration testing.
• List every possible sub-team from a small group of people.
• Explore all binary attribute combinations in a decision tree or logic problem.
• Check all possible hand sizes in a card game scenario.

Frequently Asked Questions