Skip to main content
math

Power Set Calculator

Calculate the number of subsets (power set size) of a set with n elements: |P(S)| = 2ⁿ.

Reviewed by Christopher FloiedPublished Updated

This free online power set calculator provides instant results with no signup required. All calculations run directly in your browser — your data is never sent to a server. Enter your values below and see results update in real time as you type. Perfect for everyday calculations, homework, or professional use.

Number of elements in the set

Results

Total subsets |P(S)|

8

Proper subsets

7

Non-empty subsets

7

How to Use This Calculator

1

Enter your input values

Fill in all required input fields for the Power Set Calculator. Most fields include unit selectors so you can work in your preferred unit system — metric or imperial, whichever matches your problem.

2

Review your inputs

Double-check that all values are correct and that you have selected the right units for each field. Incorrect units are the most common source of calculation errors and can produce results that are off by factors of 2, 10, or more.

3

Read the results

The Power Set Calculator instantly computes the output and displays results with units clearly labeled. All calculations happen in your browser — no loading time and no data sent to a server.

4

Explore parameter sensitivity

Try adjusting individual input values to see how the output changes. This is a quick and effective way to develop intuition about how different parameters influence the result and to identify which inputs have the largest effect.

When to Use This Calculator

  • •Use the Power Set Calculator when you need a quick mathematical result without writing out all the steps manually, saving time on repetitive calculations.
  • •Use it to verify hand calculations on tests or assignments and catch arithmetic mistakes.
  • •Use it when teaching or explaining mathematical concepts to others, demonstrating how changing inputs affects the result.
  • •Use it to explore the behavior of mathematical functions across a range of inputs.

Related Calculators

Log Calculator (Logarithm)

Calculate the logarithm of a number in any base. Computes log_b(x) — the power to which base b must be raised to produce x.

Order of Magnitude Calculator

Determine the order of magnitude of a number — the power of 10 closest to that number. Useful for estimation, comparison, and Fermi calculations.

Absolute Value Calculator

Calculate the absolute value of any real number. The absolute value represents the distance of a number from zero on the number line, always returning a non-negative result.

Annulus Area Calculator

Calculate the area of an annulus (ring shape) using A = PI*(R^2 - r^2), where R is the outer radius and r is the inner radius. Essential for engineering washers, pipe cross-sections, circular tracks, orbital mechanics, and ring-shaped design elements.

Antilog Calculator

Calculate the antilogarithm (inverse logarithm) — convert a log value back to its original number. Antilog_b(y) = b^y.

Collatz Conjecture Calculator

Trace the Collatz sequence (3n+1 problem) from any positive integer. Count the number of steps to reach 1 and find the maximum value reached.

About Power Set Calculator

The Power Set Calculator computes the total number of subsets of a set with n elements. The power set P(S) of a set S is the collection of all subsets of S, including the empty set and S itself. The size of the power set is always 2ⁿ, where n is the number of elements in S. This exponential growth makes power sets fundamental in combinatorics, probability theory, computer science (Boolean functions), and set theory. The power set concept connects to binary representations (each element is either in or out of a subset), the binomial theorem (2ⁿ = Σ C(n,k)), and propositional logic (truth tables have 2ⁿ rows for n variables). Understanding power sets is essential for analyzing algorithmic complexity, counting problems, and the foundations of mathematics.

The Math Behind It

The power set P(S) of a set S = {a₁, a₂, ..., aₙ} is the set of all subsets of S. It contains 2ⁿ elements because each of the n elements is independently either included or excluded from a subset, giving 2 choices per element and 2ⁿ total subsets. These subsets can be grouped by size: there are C(n, 0) = 1 subset of size 0 (the empty set), C(n, 1) = n subsets of size 1, C(n, 2) subsets of size 2, and so on, up to C(n, n) = 1 subset of size n (the set S itself). The sum Σ C(n, k) for k = 0 to n equals 2ⁿ, confirming the power set size. The power set has a natural ordering by inclusion (⊆), forming a partially ordered set called a Boolean lattice. In computer science, subsets of an n-element set correspond to n-bit binary strings, where bit k indicates whether element k is included. This bijection is used in algorithms that enumerate all subsets (bitmask enumeration). The power set axiom in Zermelo-Fraenkel set theory asserts that the power set of any set exists. Cantor's theorem proves that |P(S)| > |S| for any set S, which implies there is no largest set and leads to the hierarchy of infinite cardinal numbers.

Formula Reference

Power Set Size

|P(S)| = 2ⁿ

Variables: n = number of elements in set S

Subsets of size k

C(n, k) = n! / (k!(n-k)!)

Variables: Number of subsets with exactly k elements

Worked Examples

Example 1: Small set

Find the power set of S = {1, 2, 3}

Step 1:n = 3 elements
Step 2:Total subsets: 2³ = 8
Step 3:List: {}, {1}, {2}, {3}, {1,2}, {1,3}, {2,3}, {1,2,3}
Step 4:Proper subsets (excluding S itself): 8 - 1 = 7

8 total subsets, 7 proper subsets

Example 2: Counting by size

For n = 4, how many subsets of each size?

Step 1:Size 0: C(4,0) = 1
Step 2:Size 1: C(4,1) = 4
Step 3:Size 2: C(4,2) = 6
Step 4:Size 3: C(4,3) = 4
Step 5:Size 4: C(4,4) = 1
Step 6:Total: 1+4+6+4+1 = 16 = 2⁴

16 total subsets: 1+4+6+4+1

Common Mistakes & Tips

  • !Forgetting to include the empty set as a subset (it is always a subset of every set)
  • !Confusing 'proper subset' (excludes the set itself) with 'non-empty subset' (excludes the empty set)
  • !Underestimating the exponential growth: 2²⁰ = 1,048,576 subsets for just 20 elements
  • !Confusing subsets with elements: a subset is a set, not an individual element

Related Concepts

Binomial Coefficient

C(n,k) counts subsets of a specific size k

Truth Table

Truth tables for n variables have 2ⁿ rows, matching the power set size

Used in These Calculators

Calculators that build on or apply the concepts from this page:

Binomial Coefficient Calculator

Truth Table Generator

Frequently Asked Questions

Why does the power set grow so fast?

Each element doubles the number of subsets (every existing subset spawns a new one by including the new element). This doubling at each step creates exponential growth: 2¹ = 2, 2² = 4, 2³ = 8, ..., 2¹⁰ = 1024, 2²⁰ ≈ 1 million.

Is the empty set always in the power set?

Yes. The empty set {} is a subset of every set, so it is always an element of the power set. Similarly, the set S itself is always in P(S).

Embed this calculator on your site

Paste this snippet into your blog, course page, or documentation to drop a live, interactive Power Set Calculator into your page.

Free to embed — includes a link back to MegaCalc.