Professional Documents
Culture Documents
RZC Chp9 PigeonholePrinciple Slides
RZC Chp9 PigeonholePrinciple Slides
RZC Chp9 PigeonholePrinciple Slides
Dr J Frost (jfrost@tiffin.kingston.sch.uk)
www.drfrostmaths.com
A: London
B: Paris
C: Madrid
Starter Question
1 2 3 4 5 6 7 8
Solution: There are four pairs of numbers which add up to 9:
{1, 8}, {2,7}, {3,6}, {4,5}.
?
For the numbers we choose, each must belong to
one of the four pairs. But there’s 5 numbers, so two
must belong to the same pair.
The Pigeonhole Principle
Imagine that we have a number of slots, or ‘pigeon holes’
in which we can put letters.
8 2 7 6
4
{1,8} {2,7} {3,6} {4,5}
By the pigeonhole
The letters principle, as we used
represent the more numbers then
Each pigeonhole pairs, two of the
numbers from 1
represents a to 8 we choose. numbers must be in
number pair. the same pair.
When we spread out the letters as much as possible, we found that the maximum
number of letters was 3.
Dijkstra’s Principle (just a variant of the ‘Pigeonhole Principle’) states that all the
maximum number of letters must be at least the average number of letters.
Dijkstra’s Principle
Question: There are 1000 people in the room. What is the minimum
number of people that share the same birthday?
Solution: 3. By the pigeonhole principle, the maximum number of
birthdays is at least 1000/365 = 2.74.
? Therefore at least 3 people share
the same birthday.
Restricted Allocation
Sometimes how we put letters in some pigeonholes restricts how we put
them in others.
There are n people at a party, where each person can shake hands with
others at the party (or if they’re antisocial, no one at all), although they
can only shake a given person’s hand at most once. Show that at least 2
people must have had the same number of handshakes.
Bob
Jim
0 1
.... Tim
n-1 n
20 cities are visited by up to 20 people each, such that no two cities are
visited by the same number of people.
Question: A cinema sells 31 tickets in total one evening, and each movie
can be watched by up to 3 people (but won’t screen if no one shows up).
Show that the minimum number of movies seen by the same number of
people is 6.
Let’s deconstruct the problem:
Question: A cinema sells 31 tickets in total one evening, and each movie
can be watched by up to 3 people (but won’t screen if no one shows up).
Show that the minimum number of movies seen by the same number of
people is 6. This means that
Meerkatman was
seen by 3 people.
Bat Spider Meerkat This letter thus
man man man represents 3 tickets.
1 2 3
Question: A cinema sells 31 tickets in total one evening, and each movie
can be watched by up to 3 people (but won’t screen if no one shows up).
Show that the minimum number of movies seen by the same number of
people is 6.
Given that putting one letter in each pigeonhole represents 6 total tickets, we can put
Toucan
5 letters in each ticket to get us to 30 tickets. man
We have 1 ticket left. This must have been for a movie watched by 1 person. And thus, six movies were
watched by the same number of people. (Although note that there’s other solutions in which 6 movies
were watched by the same number of people, e.g. Once we got to 4 letters in each hole, we could have
put 2 letters in the ‘3 hole’ and one in the ‘1 hole’ – the point is that we’ve proved that 6 is the minimum)
BMO Problem
Question: Let S be a subset of the set of numbers {1, 2, 3,
… , 2008} which consists of 756 distinct numbers. Show that
there are two distinct elements, a, b of S such that a + b is
divisible by 8.
Things that might be going through your head when you see this
problem:
“What are my pigeonholes and what are my letters?”
“How might I be restricted in putting letters into pigeonholes?”
“It sounds like from the question that we can have 755 numbers
without any two of them adding to give a multiple of 8. The
problem is therefore equivalent to ‘show that 755 is the
maximum numbers of numbers we can choose without this
happening’”.
BMO
Round 2
Round 1
BMO Problem
Question: Let S be a subset of the set of numbers {1, 2, 3, … , 2008} which
consists of 756 distinct numbers. Show that there are two distinct elements, a, b
of S such that a + b is divisible by 8.
10
80
26
0 1 2 3
4 5 6 7
10
80 There’s 2008 numbers, so 2008/8 =
26
251 letters belong to each
pigeonhole (e.g. all the multiples of
0 1 2 3 8, of which there are 251, would go
in the ‘0’ pigeonhole).
We would put 251 letters in either
hole 1 or 7. Similarly, we could put
251 in hole 2 or 6. And another 251 in
4 5 6 7 hole 3 or 5. And we could put 1 in
holes 0 and 4. That gives us 251 + 251
+ 251 + 1 + 1 = 755. This therefore is
the maximum number before two of
the numbers add to a multiple of 8.
With 756, we’d therefore violate this
property.
BMO Problem
Question: A booking office at a railway station sells tickets
to 200 destinations. One day, tickets were issued to 3800
passengers. Show that
(i) there are (at least) 6 destinations at which the passenger
arrival numbers are the same;
(ii) the statement in (i) becomes false if ‘6’ is replaced by ‘7’.
Things that might be going through your head when you see this
problem:
“What are my pigeonholes and what are my letters?”
“What’s the average number of people at each station?” i s a Round 2
Yes, this Don’t
“A station is limited in the number of people that can buy a n!
questio
ticket for there. For example, if 3800 all bought a ticket for the panic!
same station, there wouldn’t be 200 destinations! So we must
have to restrict the allocation of letters to pigeonholes in some BMO
way.” Round 2
Round 1
BMO Problem
Question: A booking office at a railway station sells tickets to 200 destinations. One day, tickets were
issued to 3800 passengers. Show that (i) there are (at least) 6 destinations at which the passenger
arrival numbers are the same; (ii) the statement in (i) becomes false if ‘6’ is replaced by ‘7’.
0 1
.... Hull
18 19 20
...
My solution: Model the pigeonholes as the number of tickets for a station. Let the
letters be the stations (so Bath goes in pigeonhole 1 if 1 person is going to Bath).
If there’s 3800 passengers, and 200 destinations, there’s an average of 19 people per
station. Note that this relates to the average value of the pigeonhole, NOT the average
number of letters in each pigeonhole.
The key to this strategy is thinking how we allocate letters to pigeonholes so the
average pigeonhole value is 19.
BMO Problem
Question: A booking office at a railway station sells tickets to 200 destinations. One day, tickets were
issued to 3800 passengers. Show that (i) there are (at least) 6 destinations at which the passenger
arrival numbers are the same; (ii) the statement in (i) becomes false if ‘6’ is replaced by ‘7’.
0 1
.... 37 38
Kings
Cross
39
...
We want to minimise the number of letters in each pigeonhole. The way to do this is
put one letter in each of the pigeonholes 0 to 38. As highlighted earlier, this ensures
the average people per destination is still 19 whilst minimising the number of stations
with the same number of passengers.
BMO Problem
Question: A booking office at a railway station sells tickets to 200 destinations. One day, tickets were
issued to 3800 passengers. Show that (i) there are (at least) 6 destinations at which the passenger
arrival numbers are the same; (ii) the statement in (i) becomes false if ‘6’ is replaced by ‘7’.
0
Madrid
1
.... Berne
37
Hell
38
Kings
Cross
39
...
We keep adding in this way for each 39 stations.
Each time we do, this represents 0 + 1 + 2 + 3 + ... + 38 tickets. Using the standard
summation formula, this gives 741 tickets. 741 goes into 3800 five whole times, so we
have 5 letters in each of the pigeonholes 0 to 38 and have 741x5 = 3705 tickets.
How do we deal with the remaining 95 tickets? The average per station needs to be 19,
which means we’re spreading these over 95/19 = 5 stations. So using the 17, 18, 19, 20
and 21 pigeonholes will do to keep the quantities of tickets for each station spread out..
Thus in the minimal case, 5 quantities of tickets will have 6 stations with that quantity.
This proves (ii) as well, because we’ve proved this minimum can be 6.
One final problem…
Suppose n is 5. Then we have 5 odd numbers, 1, 3, 5, 7, 9,
and the numbers in each pigeonhole (using the hint
above) will be:
?
We have 5 pigeonholes (as there are 5 odd numbers), but
5+1 = 6 numbers to pick. So by the pigeonhole principle,
we’ll have chosen at least 2 numbers from one set. And
clearly the numbers in each set divide each other, since
when .
Summary
For some problems, we use can use pigeonholes to represent different
values, and letters to represent items can have one of these values.
Be careful how you model these.