Difference between revisions of "Pigeonhole Principle/Solutions"
(→M3) |
Diabologuy (talk | contribs) (→M1) |
||
| Line 13: | Line 13: | ||
==Intermediate== | ==Intermediate== | ||
===M1=== | ===M1=== | ||
| − | The maximum number of friends one person in the group can have is | + | The maximum number of friends one person in the group can have is n-1, and the minimum is 0. If all of the members have at least one friend, then each individual can have somewhere between <math>1</math> to <math>4</math> friends; as there are <math>n</math> individuals, by pigeonhole there must be at least two with the same number of friends. If one individual has no friends, then the remaining friends must have from <math>1</math> to <math>n-2</math> friends for the remaining friends not to also have no friends. By pigeonhole again, this leaves at least 1 other person with 0 friends. |
===M2=== | ===M2=== | ||
Revision as of 12:45, 12 January 2013
These are the solutions to the problems related to the Pigeonhole Principle.
Contents
Introductory
I1
The Martian must pull 5 socks out of the drawer to guarantee he has a pair. In this case the pigeons are the socks he pulls out and the holes are the colors. Thus, if he pulls out 5 socks, the Pigeonhole Principle states that some two of them have the same color. Also, note that it is possible to pull out 4 socks without obtaining a pair.
I2
Consider the residues of the elements of 
, modulo 
. By the Pigeonhole Principle, there exist distinct 
such that 
, as desired.
Intermediate
M1
The maximum number of friends one person in the group can have is n-1, and the minimum is 0. If all of the members have at least one friend, then each individual can have somewhere between 
to 
friends; as there are individuals, by pigeonhole there must be at least two with the same number of friends. If one individual has no friends, then the remaining friends must have from to 
friends for the remaining friends not to also have no friends. By pigeonhole again, this leaves at least 1 other person with 0 friends.
M2
For the difference to be a multiple of 5, the two integers must have the same remainder when divided by 5. Since there are 5 possible remainders (0-4), by the pigeonhole principle, at least two of the integers must share the same remainder. Thus, the answer is 1 (E).
M3
Multiplying both sides by 
, we have
![\[|xq - p| < \frac{1}{n}.\]](http://latex.artofproblemsolving.com/b/2/9/b296b3dc2dc70011e49ceffb150e92056d8092d0.png)
Now, we wish to find a between 1 and such that 
is within 
of some integer.
Let 
denote the fractional part of 
.
Now, we sort the pigeons 
into the holes $(0, 1/n}), (1/n, 2/n), \hdots, ((n - 1)/n, 1).$ (Error compiling LaTeX. Unknown error_msg)
If any pigeon falls into the first hole, we are done.
Therefore assume otherwise; then some two pigeons 
for 
.
Assume, without loss of generality, that 
.
Then we have that 
must fall into the first or last hole, contradiction.
Olympiad
O1
By the Triangle Inequality Theorem, a side of a triangle can be less than the sum of the other two sides. Assume that the first two segments are as short as possible (1 inch). For a triangle to not exist, the next term must be 2, then 3, 5, 8, and 13 (this is the Fibonacci sequence). The 7th term is 13, which is greater than 10 inches.
O2
For the difference to be a multiple of 7, the integers must have equal modulo 7 residues. To avoid having 15 with the same residue, 14 numbers with different modulo 7 residues can be picked (
). Thus, two numbers are left over and have to share a modulo 7 residue with the other numbers under the pigeonhole principle.
O3
See this article.
O4
Inscribe a regular 
-gon, it will divide the circle into equal arcs. The length of the side of this -gon is 
, and this is an upper bound on the distance of any two points on the arc. From the pigeonhole principle one of the arcs contains at least two of the points.
O5
The pigeonhole principle is used in these solutions (PDF).
O6
This problem needs a solution. If you have a solution for it, please help us out by adding it.
