File:TooManyPigeons.jpg · Wikimedia Commons · See Wikimedia Commons
pigeonhole principle
Sign in to saveAlso known as Dirichlet's box principle, Dirichlet’s principle
mathematical lemma that, if 𝑛 items are put into 𝑚 containers, with 𝑛>𝑚, then at least one container must contain more than one item
In the Vinony graph
Within Vinony's link graph, pigeonhole principle is referenced by 118 other articles, and connects out to floor and ceiling functions, arXiv and birthday problem.
It is catalogued under topics including Combinatorics, Mathematical principles and Ramsey theory.
Its subject is documented across 50 Wikipedia language editions.
Wikidata facts
- Instance of
- theorem
- Named after
- Johann Peter Gustav Lejeune Dirichlet
Show 3 more facts
- maintained by WikiProject
- WikiProject Mathematics
- inception
- 1834-00-00
- discoverer or inventor
- Jean Leurechon
via Wikidata · CC0
~23 min read
Encyclopedic overview
Pigeons in holes. Here there are n = 10 pigeons in m = 9 holes. Since 10 is greater than 9, the pigeonhole principle says that at least one hole has more than one pigeon. (The top left hole has 2 pigeons.)
In mathematics, the pigeonhole principle states that if n items are put into m containers, with n > m, then at least one container must contain more than one item. For example, of three gloves, at least two must be right-handed or at least two must be left-handed, because there are three objects but only two categories of handedness to put them into. This seemingly obvious statement, a type of counting argument, can be used to demonstrate possibly unexpected results. For example, given that the population of London is more than one unit greater than the maximum number of hairs that can be on a human head, the principle requires that there must be at least two people in London who have the same number of hairs on their heads.
Excerpted from Wikipedia’s “pigeonhole principle” article, available under the CC BY-SA 4.0 licence.