The Basic Version of the Pigeonhole Principleis:

For all positive integers $n$ and $m$ with $m<n$, if $n$ objects are put into $m$ boxes, then at least one of the boxes contains at least $2$ objects.

Proof of Pigeon Hole PrincipleEdit

Ad blocker interference detected!

Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.