# Difference between revisions of "Principle of Inclusion-Exclusion"

Mathpro12345 (talk | contribs) (→Remarks) |
Mathpro12345 (talk | contribs) (→Examples) |
||

Line 1: | Line 1: | ||

The '''Principle of Inclusion-Exclusion''' (abbreviated PIE) provides an organized method/formula to find the number of [[element]]s in the [[union]] of a given group of [[set]]s, the size of each set, and the size of all possible [[intersection]]s among the sets. | The '''Principle of Inclusion-Exclusion''' (abbreviated PIE) provides an organized method/formula to find the number of [[element]]s in the [[union]] of a given group of [[set]]s, the size of each set, and the size of all possible [[intersection]]s among the sets. | ||

− | + | HELLO! | |

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

== See also == | == See also == |

## Revision as of 15:57, 24 October 2020

The **Principle of Inclusion-Exclusion** (abbreviated PIE) provides an organized method/formula to find the number of elements in the union of a given group of sets, the size of each set, and the size of all possible intersections among the sets.

HELLO!