Learn more about the Pigeonhole Principle and other powerful techniques for combinatorics problems in our Intermediate Counting & Probability textbook by USA Math Olympiad winner (and MIT PhD) David Patrick.

Difference between revisions of "Pigeonhole Principle"

 This is an AoPSWiki Word of the Week for July 4-July 10

Also known as the Dirichlet box principle, the basic pigeonhole principle states that if there are $n$ boxes, and more than ${n}$ objects, then one box must contain two or more objects.

The extended version of the pigeonhole principle states that for $n$ boxes, and more than ${nk}$ objects, some box must contain at least $k+1$ objects. Although this theorem seems obvious, many challenging olympiad problems can be solved by applying the pigeonhole principle.

Examples

Intermediate Problems

1. Show that in any group of five people, there are two who have an identical number of friends within the group. (Solution)
(Mathematical Circles)
2. Six distinct positive integers are randomly chosen between 1 and 2006, inclusive. What is the probability that some pair of these integers has a difference that is a multiple of 5? (Solution)

$\mathrm{(A) \ } \frac{1}{2}\qquad\mathrm{(B) \ } \frac{3}{5}\qquad\mathrm{(C) \ } \frac{2}{3}\qquad\mathrm{(D) \ } \frac{4}{5}\qquad\mathrm{(E) \ } 1\qquad$

1. Seven line segments, with lengths no greater than 10 inches, and no shorter than 1 inch, are given. Show that one can choose three of them to represent the sides of a triangle. (Solution)
2. Prove that having 100 whole numbers, one can choose 15 of them so that the difference of any two is divisible by 7. (Solution)
3. Prove that from any set of one hundred whole numbers, one can choose either one number which is divisible by 100, or several numbers whose sum is divisible by 100. (Solution)
6. There are 51 senators in a senate. The senate needs to be divided into $n$ committees such that each senator is on exactly one committee. Each senator hates exactly three other senators. (If senator A hates senator B, then senator B does 'not' necessarily hate senator A.) Find the smallest $n$ such that it is always possible to arrange the committees so that no senator hates another senator on his or her committee. (Solution)
7. Show that for any ${x\in\mathbb R}$ and positive integer ${n}$, there exists a rational number ${\frac pq}$ with $1\le q\le n$ such that $\left|x-\frac pq\right|<\frac 1{nq}.$ (Solution)