Assertion: triangle's number | /r/HasProperty | 2 n \displaystyle 2^{n
Facets:
Source sentences:
text: This is equivalent to the statement that the number of subsets (the cardinality of the power set) of an n-element set is 2 n {\displaystyle 2^{n}} , as can be seen by observing that the number of subsets is the sum of the number of combinations of each of the possible lengths, which range from zero through to n.