◀ ▲ ▶Branches / Combinatorics / Proposition: Fundamental Counting Principle
Proposition: Fundamental Counting Principle
Let \(S\) be a Cartesian product of a finitely many finite sets \[S=S_1\times S_2\times \ldots \times S_n.\] Then the cardinality of the set \(S\) is given by the product of cardinalities of its subsets. \[S=\prod_{i=1}^n S_i.\]
Table of Contents
Proofs: 1
Mentioned in:
Proofs: 1 2 3 4 5 6 7 8 9 10
Thank you to the contributors under CC BYSA 4.0!
 Github:

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