A question starts with "A set has 7 elements. How many subsets does it have?" Students who have not drilled the recognition stop and start counting: empty set, singletons, pairs, triples, and so on. After two lines of arithmetic they have either the wrong answer or the right answer in twice the time it should take.

The fast route is a two-symbol reflex. See the cardinality, fire 2^n. That is the answer. If the question specifies proper subsets instead, the answer is 2^n - 1. Nothing else matters. The article below is about training that reflex — the cue that should trigger it and the handful of edge cases where students trip.

The recognition cue

Any of these phrasings in a question is the same question wearing a different hat:

The common shape: a set with a specified cardinality, a question about subsets (or equivalently, about the power set). Whenever you see this, do not enumerate. Write 2^n where n is the cardinality. That is the answer.

The companion formula — proper subsets

If the question asks for the number of proper subsets instead, the answer is 2^n - 1.

Three formulas, each one word different in the question, each one subtraction apart. Read the question's exact wording before you write the answer.

Walked examples

Example A. A set A has 4 elements. Find |\mathcal{P}(A)|.

|\mathcal{P}(A)| = 2^4 = 16.

Example B. How many proper subsets does B = \{a, b, c, d, e\} have?

|B| = 5, so proper subsets = 2^5 - 1 = 32 - 1 = 31.

Example C. A set has 32 subsets. How many elements does it have?

Solve 2^n = 32. Since 2^5 = 32, the answer is n = 5.

Why: the number of subsets uniquely determines the cardinality, because 2^n is a strictly increasing function of n. So if you can identify the subset-count as a power of 2, taking the \log_2 gives you n instantly. A question that looks like it is giving you information about subsets is really giving you the cardinality in disguise.

Example D. How many non-empty subsets does a 6-element set have?

Total subsets = 2^6 = 64. Remove the empty set: 64 - 1 = 63. (Note: non-empty is not the same as proper.)

Why the formula is 2^n

If you have not already internalised why 2^n is the answer, the argument is worth keeping close, because it lets you rebuild the formula on a bad day when you cannot remember it.

Each of the n elements has exactly two roles when you build a subset: either it is in the subset, or it is not in it. The two choices are independent across the elements. So the total number of subsets is

\underbrace{2 \times 2 \times \cdots \times 2}_{n \text{ times}} = 2^n.

For n = 3 elements \{a, b, c\}: each element flips a coin. Eight possible outcomes, eight subsets. The bit-string 011 means "a out, b in, c in," corresponding to the subset \{b, c\}. The bit-string 000 means "none in," which is the empty set. The bit-string 111 means "all in," which is \{a, b, c\} itself. Eight outcomes, 2^3 = 8.

Interactive 2 to the n growth from n equals zero to eightA plot of the function two to the power n for integer n from zero to eight. A draggable red point labelled n moves along the curve. Above, readouts show the current value of n and the corresponding two to the power n, so you can see how fast the subset count grows.012345678n (cardinality of A)drag n
Drag $n$ along the horizontal axis. The red dot tracks the curve $2^n$, and the readout shows both $n$ and the corresponding subset count. By $n = 8$ you are already at $256$ subsets — the power set explodes faster than most students expect.

The misconception: "2n instead of 2^n"

This is the single most common error on recognition questions. A student sees "2" and "n," the pressure of the exam converts the relation to a product, and they write 2n — which for n = 5 gives 10 instead of 32. The answers are wildly different and the marking is ruthless. The formula is an exponential, not a doubling. If you have written "2n" on an exam, cross it out immediately and replace with "2^n."

Another common slip: forgetting that the formula includes both the empty set and the full set. If you have carefully listed subsets and your count is off by one or two, check whether you missed \varnothing or missed A itself.

Fast recognition — the exam check

Before writing an answer to a subset-count question, run this three-line check:

  1. What is the cardinality? Read the question and pull out n.
  2. Which variant? Plain subsets (2^n), proper subsets (2^n - 1), or non-empty proper subsets (2^n - 2)?
  3. Is n given as a number? If yes, compute 2^n directly. Powers of 2 to memorise: 2^0 = 1, 2^1 = 2, 2^2 = 4, 2^3 = 8, 2^4 = 16, 2^5 = 32, 2^6 = 64, 2^7 = 128, 2^8 = 256, 2^9 = 512, 2^{10} = 1024.

If n is symbolic (say, "a set with k elements"), leave the answer as 2^k or 2^k - 1 — do not compute unless asked.

A set $A$ has $n$ elements. The number of non-empty proper subsets of $A$ is $30$. Find $n$.

Non-empty proper subsets means neither \varnothing nor A itself. Count: 2^n - 2.

Set 2^n - 2 = 30, so 2^n = 32 = 2^5. Therefore n = 5.

Result. n = 5.

The answer came out of a single equation. If you had tried to enumerate subsets of unknown sets until one gave you 30 non-empty proper ones, you would have been there for a while. Recognition is the whole game.

Related

Sets — Introduction · How Many Subsets Does a Set with n Elements Have? · The Power Set Explorer — Tree of Subsets · Power Set of the Empty Set