Pigeonhole Principle: If a set of different elements is partitioned into mutually disjoint “boxes”, then there will be at least a “box” which will contain at least $latex k+1″ elements.
Inclusion-Exclusion Principle:
Pigeonhole Principle: If a set of different elements is partitioned into mutually disjoint “boxes”, then there will be at least a “box” which will contain at least $latex k+1″ elements.
Inclusion-Exclusion Principle: