Pigeonhole Principle/Corollary

From ProofWiki
Jump to navigation Jump to search

Corollary to Pigeonhole Principle

If a set of $n$ distinct objects is partitioned into $k$ subsets, where $0 < k < n$, then at least one subset must contain at least two elements.


Proof

A direct application of the Pigeonhole Principle.


Sources