Power Set Calculator
Our free algebra calculator solves power set problems. Get worked examples, visual aids, and downloadable results. Get results you can export or share.
Calculator
Adjust values & calculateEnter up to 20 elements separated by commas
Subsets by Cardinality
All Subsets
Formula
The power set P(S) of a set S with n elements contains all 2^n possible subsets, from the empty set to S itself. The number of subsets of size k is C(n,k) = n!/(k!(n-k)!).
Last reviewed: December 2025
Worked Examples
Example 1: Power Set of a 3-Element Set
Example 2: Power Set of a 4-Element Set
Background & Theory
The Power Set Calculator applies the following established principles and formulas. Mathematics rests on a hierarchy of number systems, each extending the previous. The natural numbers (1, 2, 3, ...) support counting and ordering. The integers add negative values and zero, enabling subtraction without restriction. The rational numbers, expressible as p/q where p and q are integers and q is nonzero, close the system under division. The real numbers fill the gaps left by irrationals such as the square root of 2 or pi, forming a complete ordered field. The complex numbers, written as a + bi where i is the square root of negative one, complete the algebraic closure of the reals and allow every polynomial to have a root. Prime factorization states that every integer greater than one is uniquely expressible as a product of primes, a result known as the Fundamental Theorem of Arithmetic. Computing the greatest common divisor (GCD) of two integers relies most efficiently on the Euclidean algorithm: repeatedly replace the larger number with the remainder when it is divided by the smaller, until the remainder is zero. The last nonzero remainder is the GCD. The least common multiple (LCM) follows from the identity LCM(a, b) = |a * b| / GCD(a, b). Modular arithmetic defines equivalence classes of integers that share the same remainder under division by a modulus n. Fermat's Little Theorem and Euler's Theorem arise from this structure and underpin modern cryptography. Logarithms are the inverses of exponential functions. If b raised to the power x equals y, then the logarithm base b of y equals x. The natural logarithm uses base e, approximately 2.71828. Combinatorics counts arrangements and selections. The number of ordered arrangements (permutations) of r objects from n distinct objects is nPr = n! / (n - r)!. The number of unordered selections (combinations) is nCr = n! / (r! * (n - r)!). Pascal's triangle arranges these binomial coefficients so that each entry equals the sum of the two entries directly above it. The Fibonacci sequence, defined by F(1) = 1, F(2) = 1, and F(n) = F(n-1) + F(n-2), appears throughout nature and connects deeply to the golden ratio via Binet's formula.
History
The history behind the Power Set Calculator traces back through the following developments. Mathematics as a systematic discipline traces to ancient Mesopotamia. Babylonian clay tablets dating to around 1800 BCE demonstrate knowledge of quadratic equations, Pythagorean triples, and base-60 arithmetic, suggesting a practical mathematical tradition far preceding Greek formalism. Euclid of Alexandria compiled the Elements around 300 BCE, establishing the axiomatic method that would define rigorous mathematics for over two thousand years. His work organized plane geometry, number theory, and proportion into logically chained propositions derived from a small set of postulates. The algorithm bearing his name for computing GCDs appears in Book VII and remains in use today. In the 9th century, the Persian scholar Muhammad ibn Musa Al-Khwarizmi wrote Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala, the treatise whose title gave algebra its name. He systematized the solution of linear and quadratic equations and described procedures that operated on unknowns as objects, a conceptual leap away from purely numerical calculation. Rene Descartes introduced coordinate geometry in 1637 by uniting algebra and Euclidean geometry, allowing curves to be studied through equations. This synthesis set the stage for calculus. Isaac Newton and Gottfried Wilhelm Leibniz independently developed calculus during the 1660s and 1670s, triggering a priority dispute that lasted decades and divided British and Continental mathematicians. Carl Friedrich Gauss proved the Fundamental Theorem of Algebra in 1799, showing that every nonconstant polynomial has at least one complex root. His Disquisitiones Arithmeticae of 1801 established modern number theory. David Hilbert's formalist program at the turn of the 20th century sought to place all of mathematics on an explicit axiomatic foundation, a project that Kurt Godel's incompleteness theorems of 1931 showed to be fundamentally limited. Alan Turing's work in the 1930s on computability introduced the theoretical model of the stored-program computer and linked mathematical logic directly to the limits of algorithmic calculation. His proof that no algorithm can decide in general whether an arbitrary program will halt or run forever placed fundamental boundaries on what mathematics can mechanically determine, and it opened the discipline now known as theoretical computer science.
Frequently Asked Questions
Sources & References
Formula
|P(S)| = 2^n where n = |S|
The power set P(S) of a set S with n elements contains all 2^n possible subsets, from the empty set to S itself. The number of subsets of size k is C(n,k) = n!/(k!(n-k)!).
Worked Examples
Example 1: Power Set of a 3-Element Set
Problem: Find the power set of S = {1, 2, 3}.
Solution: Set S has 3 elements, so |P(S)| = 2^3 = 8 subsets.\nSubsets by cardinality:\n Size 0: { } (1 subset)\n Size 1: {1}, {2}, {3} (3 subsets)\n Size 2: {1,2}, {1,3}, {2,3} (3 subsets)\n Size 3: {1,2,3} (1 subset)\nTotal: C(3,0) + C(3,1) + C(3,2) + C(3,3) = 1 + 3 + 3 + 1 = 8\nProper subsets: 8 - 1 = 7
Result: Power set has 8 subsets | 7 proper subsets | 7 non-empty subsets
Example 2: Power Set of a 4-Element Set
Problem: Find the power set of S = {x, y, z, w} and count subsets by size.
Solution: Set S has 4 elements, so |P(S)| = 2^4 = 16 subsets.\nSubsets by cardinality:\n Size 0: C(4,0) = 1 subset (empty set)\n Size 1: C(4,1) = 4 subsets\n Size 2: C(4,2) = 6 subsets\n Size 3: C(4,3) = 4 subsets\n Size 4: C(4,4) = 1 subset\nTotal = 1 + 4 + 6 + 4 + 1 = 16\nProper subsets: 16 - 1 = 15
Result: Power set has 16 subsets | 15 proper subsets | Largest group: 6 subsets of size 2
Frequently Asked Questions
What is a power set in set theory?
A power set is the set of all possible subsets of a given set, including the empty set and the set itself. If S is a set with n elements, the power set P(S) contains exactly 2^n subsets. For example, if S = {a, b}, then P(S) = { {}, {a}, {b}, {a, b} }, which has 2^2 = 4 elements. The power set is a fundamental concept in set theory, combinatorics, and mathematical logic. It demonstrates how the number of subsets grows exponentially with the size of the original set, which has important implications for computational complexity.
Why does a set with n elements always have exactly 2^n subsets?
The reason is that each element has exactly two choices: either it is included in a subset or it is not. Since each of the n elements independently makes this binary choice, the total number of possible combinations is 2 multiplied by itself n times, which equals 2^n. This can also be understood through the binary representation: each subset corresponds to a unique n-bit binary number where a 1 in position k means element k is included and a 0 means it is excluded. Since there are exactly 2^n different n-bit binary numbers (from 0 to 2^n - 1), there are exactly 2^n subsets.
How is the power set used in probability theory?
In probability theory, the power set of a sample space forms the largest possible sigma-algebra (or event space) for defining probabilities. Each element of the power set represents a possible event, and a probability function assigns a value between 0 and 1 to each event. For a finite sample space with n outcomes, the power set provides all 2^n possible events that could be assigned probabilities. For infinite sample spaces, the full power set may be too large to work with, leading to the use of smaller sigma-algebras. The concept of power sets also underlies the axioms of probability established by Kolmogorov.
Can the power set of an infinite set be computed?
The power set of an infinite set exists mathematically but cannot be fully enumerated or computed. Cantor proved that the power set of any set, finite or infinite, always has strictly greater cardinality than the original set. For instance, the natural numbers have cardinality aleph-null, but the power set of the natural numbers has cardinality 2^(aleph-null), which equals the cardinality of the continuum (the real numbers). This result is called Cantor theorem and is proved by a diagonalization argument. The continuum hypothesis, one of the most famous unsolved problems, asks whether there is a cardinality strictly between aleph-null and the continuum.
What is the computational complexity of generating a power set?
Generating a complete power set has exponential time and space complexity of O(2^n), where n is the number of elements. This means the computation doubles with each additional element. A set of 10 elements produces 1,024 subsets, 20 elements produces over one million subsets, and 30 elements produces over one billion subsets. Due to this exponential growth, generating complete power sets becomes impractical for sets larger than about 20-25 elements on standard hardware. Algorithms for power set generation include iterative bitmask enumeration, recursive approaches, and Gray code ordering which changes only one element between consecutive subsets.
How do power sets relate to Boolean algebra and logic?
The power set of any set forms a Boolean algebra under the operations of union (OR), intersection (AND), and complement (NOT). This Boolean algebra is isomorphic to the algebra of n-bit binary strings with bitwise operations. Each subset corresponds to a truth assignment for n Boolean variables. The lattice structure of the power set, ordered by inclusion, mirrors the logical implication relationships between conjunctions of literals. This connection is fundamental in digital circuit design, database query optimization, and formal verification of software systems.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy