1 Up votes0 Down votes

3.0K views21 pagesSep 09, 2009

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

Attribution Non-Commercial (BY-NC)

3.0K views

Attribution Non-Commercial (BY-NC)

- Hidden Figures: The American Dream and the Untold Story of the Black Women Mathematicians Who Helped Win the Space Race
- Hidden Figures Young Readers' Edition
- The Law of Explosive Growth: Lesson 20 from The 21 Irrefutable Laws of Leadership
- The E-Myth Revisited: Why Most Small Businesses Don't Work and
- The Wright Brothers
- The Power of Discipline: 7 Ways it Can Change Your Life
- The Other Einstein: A Novel
- The Kiss Quotient: A Novel
- State of Fear
- State of Fear
- The 10X Rule: The Only Difference Between Success and Failure
- Being Wrong: Adventures in the Margin of Error
- Algorithms to Live By: The Computer Science of Human Decisions
- The Black Swan
- Prince Caspian
- The Art of Thinking Clearly
- A Mind for Numbers: How to Excel at Math and Science Even If You Flunked Algebra
- The Last Battle
- The 6th Extinction
- HBR's 10 Must Reads on Strategy (including featured article "What Is Strategy?" by Michael E. Porter)

You are on page 1of 21

(Senior Section)

Applications of the

Pigeonhole Principle

Team members:

Edwin Kwek Swee Hee

Huang Meiizhuo

Koh Chan Swee

Heng Wee Kuan

1

Contents

Page

§1. Introduction 1

a. Dartboard applications 6

b. Encompassing problems 8

§8. Conclusion 18

Reference 19

2

Applications of the Pigeonhole Principle

§1. Introduction

Suppose that in one’s dresser drawer, he has socks of three different colours (all

placed in messy order). Having to get up early in the morning while it is still dark,

how does he ensure that he gets a matching pair of same coloured socks in the

most convenient way without disturbing his partner? While, the answer is simple!

He just has to take 4 socks from the drawer! The answer behind this is of course,

illustrate this principle. For instance, there are 3 pigeonholes around. A pigeon is

delivering 4 mails and has to place all its mails into the available pigeonholes. With

Thus, the general rule states when there are k pigeonholes and there are

k+1 mails, then they will be 1 pigeonhole with at least 2 mails. A more

The Pigeonhole Principle sounds trivial but its uses are deceiving

astonishing! Thus, in our project, we aim to learn and explore more about the

3

§2. Pigeonhole Principle and the Birthday problem

not difficult to find two persons with their birthday on the same month. For instance,

all know, there are 12 months in a year, thus, even if the first 12 people have their

birthday from the month of January to the month of December, the 13th person has

to have his birthday in any of the month of January to December as well. Thus, we

are right to say that there are at least 2 people who have their birthday falling in the

same month.

the year) with 13 pigeons (the 13 persons). Of course, by the Pigeonhole Principle,

relationship:

Suppose that there are 50 people in the room. Some of them are

acquainted with each other, while some not. Then we can show that there are two

4

Let’s assume that there is one person in the room that has no

acquaintance at all, then the others in the room will have either 1, 2, 3, 4, …, 48

them 50 “pigeons”. So, there are at least two persons that have the same number

Next, if everyone in the room has at least one acquaintance, we will still

Also, we can apply the Pigeonhole Principle in the proving of numerical properties.

Consider the following random list of 12 numbers say, 2, 4, 6, 8, 11, 15, 23,

34, 55, 67, 78 and 83. Is it possible to choose two of them such that their

0, 1, 2, 3, …………….., 9, 10.

But we have 12 numbers. If we take the remainders for “pigeonholes” and the

numbers for “pigeons”, then by the Pigeon-Hole Principle, there are at least two

5

pigeons sharing the same hole, ie two numbers with the same remainder. The

In fact, in our example, there are several answers as the two numbers

x-y 1

select two of them say x and y, which satisfy the inequality that 0 < < ?

1 + xy 3

answer the above problem, one will be surprised to know that we just need a

Before proceeding to answer the problem, we first note that given any real

π π

number x, we can always find a real number α where − < α < such that

2 2

π π

tan α = x. For example, 3 = tan , −1=tan(− ). So, with given 7 distinct

3 4

numbers n1, n2, ……..and n7, we can find 7 distinct numbers α1, α2, …….α7 in the

6

n1 = tan α1, n2 = tan α2, …………….., n7 = tan α7

Now, if we were to divide the interval (−π, π) into 6 equal intervals, we obtain the

following sub-intervals:

1 1 1 1 1 1 1 1 1 1

(− π, − π ), [ − π, − π ), [ − π, 0 ) , [ 0, π ), [ π, π ) and [ π, π ).

2 3 3 6 6 6 6 3 3 2

For the 7 distinct numbers α1, α2, …….α7, by the Pigeonhole Principle, there

should be two values say, αi and αj such that αI > αj and αi & αj are in the same

1

interval! For these two values αi and αj, we should have 0 < αI − αj < π.

6

tan A - tan B

tan ( A − B ) = .

1 + tan A tan B

ni - n j tan α i - tan α j

Thus, if ni = αi and nj = αj , then =

1 + nin j 1 + tan α i tan α j

= tan ( αi − αj )

1 1

As 0 < αI − αj < π, tan 0 < tan ( αi − αj ) < tan π

6 6

1

0 < tan ( αi − αj ) <

3

ni - n j 1

and so, 0 < < ,

1 + nin j 3

7

We may also apply the Pigeonhole Principle in the proving of useful daily

a. Dartboard applications

are those which involve the dartboard. In such questions, a given number of darts

are thrown onto a dartboard, the general shape and size of which are known.

As with most questions involving the pigeonhole principle, the hardest part is to

Example 1:

Seven darts are thrown onto a circular dartboard of radius 10 units. Can we

show that there will always be two darts which are at most 10 units apart?

To prove that the final statement is always true, we first divide the circle into

8

Allowing each sector to be a pigeonhole and each dart to be a pigeon, we

least one sector containing a minimum of two darts. Since the greatest distance

between two points lying in a sector is 10 units, the statement is proven to be true

in any case.

In fact, it is also possible to prove the scenario with only six darts. In such a

case, the circle is this time divided into five sectors and all else follows. However,

take note that this is not always true anymore with only five darts or less.

Example 2:

hexagon with side length of 1 unit. Can we prove that there are two darts within

3

units of each other ?

3

With the six triangles as our pigeonholes and the 19 darts as pigeons, we

find that there must be at least one triangle with a minimum of 4 darts in it.

9

Now, considering the best case scenario, we will have to try an equilateral

If we try to put the points as far apart from each other as possible, we will

end up assigning each of the first three points to the vertices of the triangle. The

last point will then be at the exact centre of the triangle. As we know that the

distance from the centre of the triangle to each vertex is two-third of the altitude of

2 3 3

this triangle, that is, × = units, we can see that it is definitely possible

3 2 3

3

to find two darts which are units apart within the equilateral triangle!

3

b. Encompassing problems

51 points are placed, in a random way, into a square of side 1 unit. Can we prove

1

that 3 of these points can be covered by a circle of radius units ?

7

10

To prove the result, we may divide the square into 25 equal smaller squares of

1

side units each. Then by the Pigeonhole Principle, at least one of these small

5

squares (so call “pigeonholes”) should contain at least 3 points (ie the “pigeons”).

Otherwise, each of the small squares will contain 2 or less points which will then

mean that the total number of points will be less than 50 , which is a contradiction

1

radius

10

1

10

Now the circle circumvented around the particular square with the three points

1 2 1 2 1 1 1

radius = ( ) + ( )2 = = < = units !

10 10 100 50 49 7

11

Next, we will like to proceed to a more creative aspect of the application of

tricks:

standard deck of playing cards. The participant does not show these cards to the

magician, but does show them to the magician’s accomplice. The accomplice

looks at the five cards, chooses four of them, and shows these four to the

magician in a certain ordered manner. The magician immediately identifies the fifth

hidden card.

(1) First of all, notice that in any hand of five cards there must be two cards of

the same suit (an application of Pigeonhole Principle). The first card that the

accomplice shows to the magician is one of these two cards. The other card

of the same suit is never shown – it is the mystery card, the card which the

12

magician must discover. Thus, the accomplice can easily communicate the suit of

the hidden card: the hidden card has same suit as the first card shown to the

magician. Specifying the rank of the mystery card (ie its value) is a little trickier

but can be accomplished with a little “circular counting” manner which we will

explained below

Number the cards in a suit circularly from 1(ace) to 11 (jack), 12 (queen) and 13

Now, given any two cards A and B, define distance (A,B) as the clockwise

distance from A to B. It is easy to see that for any two cards A and B either

13

Example

From those two cards of the same suit, A and B, the accomplice shows the

For example, given the choice between the three of clubs and the Jack of clubs,

the accomplice reveals the Jack (since distance (Jack ,3) = 5 and distance(3,

If the two same-suit cards are the five of hearts and the six of hearts, the

accomplice chooses the five (since distance (5,6) = 1 but distance (6,5) = 12)

(3) Finally, the accomplice arranges the last three cards to encode a number

from 1 to 6 – the distance from the value of first card to that of the hidden

card. A quick calculation allows the magician to discover the value of the mystery

card. Notice that although the magician must decode only one of 6 possibilities, it

14

To facilitate the explanation for the last step involved, we may assign each card a

……………………………..,

……………………………….,

……………………………….,

……………………………. ,

……………………………. ,

We will now proceed to explain the last step using the following example:

Example:

15

(iii) 6 of Clubs (numbered 35)

The accomplice notices that the 3 and the 7 have the same suit-- hearts. Since the

first card to show the magician, leaving the 7 of hearts as the hidden card. The

magician now knows that the suit of the mystery card is hearts. The accomplice's

next task is thus to let the magician know that he must add the value 4 to the

How can he achieve this? Basically, he can arrange the other three cards in 3! = 6

ways. Based on the numbering method explained earlier, the 3 remaining cards

can be ranked 1st, 2nd and 3rd . In our example, the 6 of Clubs will be ranked 1,

the 5 of Spades will be ranked 2 and the 2 of Diamonds will be ranked 3. The

accomplice may agree with the magician earlier that the arrangement of these 3

1, 2, 3 1

1, 3, 2 2

2, 1, 3 3

2, 3, 1 4

3, 1, 2 5

3, 2, 1 6

16

Thus in our example, the accomplice should display the cards in the following

manner: firstly, the 5 of Spades, then the 2 of Diamonds and lastly, the 6 of

Clubs !

are labelled 1 to 10 in a hidden "face down" manner. The participant does not

show the arrangement of these cards to the magician, but does show them to the

magician’s accomplice. The accomplice looks at the ten cards and flips over six of

the cards in a certain ordered manner to reveal their values to the magician. The

magician immediately identifies the values of the four remaining unknown cards.

We first note that by applying the Pigeonhole Principle, we can show that in any

(refer next section of our discussion). These are the numbers that remain hidden in

our trick. The magician will know that the sequence is increasing if the accomplice

flips over the other six cards from the left to right and it is decreasing if the other six

17

Given any sequence of mn+1 real numbers, some subsequence of (m+1)

Assume that the result is false. For each number x in the sequence, we have the

ordered pair (i, j), where i is the length of the longest increasing subsequence

beginning with x, and j is the length of the longest decreasing subsequence ending

with x. Then, since the result is false, 1 ≤ i ≤ m and 1 ≤ j ≤ n. Thus we have mn+1

Principle, two members of the sequence, say a and b, are associated with the

same ordered pair (s, t). Without loss of generality, we may assume that a

If a<b, then a, together with the longest increasing subsequence beginning with b,

18

Here is an example of how the trick can be performed:

Example

Suppose the participant arranges the 10 cards in the following manner (value

If he decides to use the increasing subsequence, he should leave the first four

cards untouched and flips the other six cards over in a leftward manner as shown:

1 7 4 2 6 9

Direction of flip

The magician on realising that the four missing numbers are 3, 5, 8 and 10 and the

leftward direction of flip, will thus proclaim the 4 hidden numbers to be 3, 5, 8, and

10 respectively!

If the accomplice decides to use the decreasing subsequence, he should leave the

cards bearing the numbers 10, 7, 4, 2 untouched and flips the other six cards over

19

3 5 8 1 6 9

Direction of flip

The magician on realising that the four missing numbers are 2, 4, 7 and 10 and the

rightward direction of flip, will thus proclaim the 4 hidden numbers (from left to

§8. Conclusion

Although the Pigeonhole Principle seems simple and trivial, it is extremely useful

in helping one to formulate and facilitate calculation and proving steps for

we will like to show that a simple Mathematical concept like the Pigeonhole

Principle does have numerous interesting and beneficial application in our daily

life!

~ ~ ~ ~ ~ End of Report ~ ~ ~ ~ ~

20

Reference

2. Article on "A Combinatorial Card Trick" by Professor Ralph Bravaco and Shai

Bessonova.

Association of America

21

- Center of Mass3Uploaded byahmadskhan
- Problem primer for olympiadUploaded byvermashresth
- Class 10 Cbse Maths 2010 Sample Paper Model 2Uploaded bySunaina Rawat
- Mathematical CirclesUploaded byJose María Pizzano Mancera
- PiramidUploaded bysabunbening
- Pigeonhole PrincipleUploaded byAbraham Jyothimon
- Exam 2Uploaded byjemeripol
- Cgi Placement Paper Aptitude Question Paper 20 August 2012 3173Uploaded bymeghnadash29
- Exeter Math Club Contest 2013Uploaded bysteven_g_lee
- Form 2 Revision Exercises (2)Uploaded byAmrik DS
- Applications of Pigeonhole PrincipleUploaded bytruoccuocdoi
- The Use of Logo ProgrammingUploaded byelma2552682
- Maths Problem Solving - for children of year 6 / grade 6Uploaded byactuaryinmaking
- Contest 2Uploaded byIllos
- WorksheetUploaded byMurugan Manikam
- VU6Gs0MWEEHhdFC6JqJsUploaded byKumar Sudhanshu
- Senior 2008-2011Uploaded bytohagoravsky
- chu091709Uploaded byAndrei Petrus
- movement lesson planUploaded byapi-280468444
- Exploring Geometry - Mathematics kit.docUploaded byharigup
- geometrylessonsUploaded byapi-276813042
- MSB-Geometry-class-9-bOARD-PAPER-2-Sol.pdfUploaded bySHREERAJ TrIcKs for MATHEMATICS
- Java TasksUploaded byHadi Abdullah Khan
- Tcs Test BecUploaded bySrikanth Reddy
- 07-10-2012.pdfUploaded bysaurabh chaturvedi
- k(13) Proof LeechUploaded byandy327
- C11 Lines Planes in 3DUploaded byNurul Nor Syahda
- 2003 State SolutionsUploaded by12dasani
- 6th July SolutionsUploaded byPratik Patel
- PM Chapter 3 Coordinate GeometryUploaded byQiyao Leong

- A Year of ChangeUploaded bythechillmachine
- India's Struggle for IndependenceUploaded byJagatjeet Turuk
- Contribution of Women in India's struggle for IndependenceUploaded bythechillmachine
- The Standard Model and the Higgs BosonUploaded bythechillmachine
- Sample Notes for SociologyUploaded bynylashahid
- IGNOUUploaded bychandniee
- Was Gandhi Suppoter of Caste SystemUploaded bythechillmachine

- Who is the Leading EOT Crane Manufacturer firm in India?Uploaded byManish Patel
- NketrainUploaded bygizemk1
- Learnings From Other Nations by Pranesh Misra (1)Uploaded bySanjay Kumar
- Aria Steal Me.pdfUploaded byElizabeth Munoz
- Jeuness Eng 2016Uploaded byszigyarto_maria
- sobre cinemaUploaded bySilvio Demétrio
- Intro Physics Instructors Guide Semester1 AppendixAUploaded byGfour Maserati
- TN-29Uploaded bypolanco999
- Geometric TownUploaded bymelissaglevin
- SI_5VV0B_En_v1_m56577569830604982Uploaded byiodin
- New Enrolment ListsUploaded byShashi Naganur
- Gullman10Uploaded bydanielscares
- Martin-baker Mk10Uploaded byLucio Carruego
- Dtvgs EagleUploaded byjahedo
- Automatic air suspentionUploaded byashu047
- 222062_1320092914NM Marketplace Nov 11 Zone 4 FliploUploaded byCoolerAds
- 73 Mag - Sept 1999Uploaded byAnonymous YDF1ID15zJ
- EchoLife HG8240&HG8245&HG8247 GPON Terminal Service ManualUploaded bydcanas72
- Linhof Price 13Uploaded bycondivis
- Ae Ivao Quick View v1 5 Jan2017Uploaded byRelja
- ict matrixUploaded byapi-239263745
- A NEWBIES GUIDE TO SETTING UP A DM500S FOR CARDSHARINGUploaded byDarshana
- QuickVision DICOM_v1Uploaded byDescargaSolamente
- RiggersUploaded byAlexander Amann
- LightningPhotography.pdfUploaded bykllado
- 599_09_99Uploaded bykr3e
- CVPR2010: grouplet: a structured image representation for recognizing human and object interactionsUploaded byzukun
- Arduino Catalog From Grace-0623Uploaded byGajendran Rao
- Victoria Ransom of Red Chief OutlineUploaded byVictoria Jonczyk
- AEG FAV80800Uploaded byAnonymous WluxrtKaB

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.