Inclusion–exclusion principle

In combinatorics, the inclusion–exclusion principle (Commonly referred to as PIE) is a counting technique which generalizes the familiar method of obtaining the number of elements in the union of two finite sets; symbolically expressed as | A ∪ B | = | A | + | B | − | A ∩ B | {\displaystyle |A\cup B|=|A|+|B|-|A\cap B|} where A and B are two finite sets and |S| indicates the cardinality of a set S (which may be considered as the number of elements of the set, if the set is finite). The formula expresses the fact that the sum of the sizes of the two sets may be too large since some elements may be counted twice.

Source: Wikipedia — Inclusion–exclusion principle (CC BY-SA 4.0)

Inclusion–exclusion principle

In combinatorics, the inclusion–exclusion principle (Commonly referred to as PIE) is a counting technique which generalizes the familiar method of obtaining the number of elements in the union of two finite sets; symbolically expressed as | A ∪ B | = | A | + | B | − | A ∩ B | {\displaystyle |A\cup B|=|A|+|B|-|A\cap B|} where A and B are two finite sets and |S| indicates the cardinality of a set S (which may be considered as the number of elements of the set, if the set is finite). The formula expresses the fact that the sum of the sizes of the two sets may be too large since some elements may be counted twice.

This neuron ends here.

Source: Wikipedia "Inclusion–exclusion principle" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy