◀ ▲ ▶Branches / Combinatorics / Proposition: Number of Subsets of a Finite Set
Proposition: Number of Subsets of a Finite Set
Let \(X\) be a finite set with \(X=n\). Then the number of subsets of \(X\),
i.e. the cardinality of the power set $\mathcal P(X),$ equals \(2^{n}.\)
Table of Contents
Proofs: 1 2
Mentioned in:
Proofs: 1
Thank you to the contributors under CC BYSA 4.0!
 Github:

References
Bibliography
 Aigner, Martin: "Diskrete Mathematik", vieweg studium, 1993