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

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

Line 4: | Line 4: | ||

Sometimes it is also useful to know that, if you take into account only the first <math>m\le n</math> sums on the right, then you will get an overestimate if <math>m</math> is [[odd integer | odd]] and an underestimate if <math>m</math> is [[even integer | even]]. | Sometimes it is also useful to know that, if you take into account only the first <math>m\le n</math> sums on the right, then you will get an overestimate if <math>m</math> is [[odd integer | odd]] and an underestimate if <math>m</math> is [[even integer | even]]. | ||

So, | So, | ||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

and so on. | and so on. |

## Revision as of 17:05, 18 September 2016

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.

## Remarks

Sometimes it is also useful to know that, if you take into account only the first sums on the right, then you will get an overestimate if is odd and an underestimate if is even. So,

and so on.

## Examples

Don't have any.