PIGEONHOLE PRINCIPLE.

Slides:



Advertisements
Similar presentations
The Pigeonhole Principle:
Advertisements

The Pigeon hole problem
Breakfast Bytes: Pigeons, Holes, Bridges and Computers Alan Kaylor Cline November 24, 2009.
Quiz highlights Probability of the song coming up after one press: 1/N. Two times? Gets difficult. The first or second? Or both? USE THE MAIN HEURISTICS:
PIGEONHOLE PRINCIPLE. Socks You have a drawer full of black and white socks. Without looking in the drawer, how many socks must you pull out to be sure.
The Pigeonhole Principle
Fall 2015 COMP 2300 Discrete Structures for Computation
The Pigeonhole (Dirichlet’s box) Principle
1 Excursions in Modern Mathematics Sixth Edition Peter Tannenbaum.
Math 170 Project #11 Part 2 Jeffrey Martinez Bianca Orozco Omar Monroy.
Sight words.
Symmetry Problem What is the sum of the values 1 to 100? Hint: Look for the symmetry!
1 Chapter 2 Pigeonhole Principle. 2 Summary Pigeonhole principle –simple form Pigeonhole principle –strong form Ramsey’s theorem.
1 The Pigeonhole Principle CS 202 Epp section 7.3.
The Pigeonhole Principle. Pigeonhole principle The pigeonhole principle : If k is a positive integer and k+1 or more objects are placed into k boxes,
Pigeonhole Principle – Page 1CPTR311 – Discrete Structures CPTR311 Discrete Structures Pigeonhole Principle Reading: Kolman, Section 3.3.
Pigeonhole Principle. If n pigeons fly into m pigeonholes and n > m, then at least one hole must contain two or more pigeons A function from one finite.
Discrete Mathematics. Exercises Exercise 1:  There are 18 Computer Science (CS) majors and 325 Business Administration (BA) majors at a college.
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Comparing Sampling Methods
Excursions in Modern Mathematics Sixth Edition
Excursions in Modern Mathematics Sixth Edition
Discrete Mathematics Lecture 6
Hamiltonian Graphs Graphs Hubert Chan (Chapter 9.5)
Any questions on today’s homework. (Sections 1. 6/1
ICS 253: Discrete Structures I
The Pigeonhole Principle
CSC 321: Data Structures Fall 2015 Counting and problem solving
How can values be expressed in multiple ways?
CSNB 143 Discrete Mathematical Structures
Çizge Algoritmaları.
PIGEONHOLE PRINCIPLE.
Discrete Structures for Computer Science
To complete balancing calculations.
Konigsberg’s Seven Bridges
Hamiltonian Graphs Graphs Hubert Chan (Chapter 9.5)
Say the words as quick as you can!
Dolch Words Step 3 Step 1 Step 2 Step 4 into blue by did came go
PIGEONHOLE PRINCIPLE.
PIGEONHOLE PRINCIPLE.
Backstreet Boys 后街男孩.
High Frequency Words. High Frequency Words a about.
00:49.
Word Problems with Inequalities
Probability.
Sight Words.
KINDERGARTEN HIGH FREQUENCY WORD LIST
Euler Paths and Circuits
Euler Paths & Euler Circuits
Graph Theory.
Click when ready....
Excursions in Modern Mathematics Sixth Edition
Complete Dolch Sight Word List Preprimer through Third
The Pigeonhole Principle
Konigsberg- in days past.
The Pigeonhole (Dirichlet’s box) Principle
Counting techniques Basic Counting Principles, Pigeonhole Principle, Permutations and Combinations.
Dolch Sight Word.
Route Inspection Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we introduce a vertex.
The Pigeonhole Principle
6.7 Graphing Inequalities in Two Variables
Dolch Sight Words 220 Words Pre-primer – 3 rd Grade.
The Pigeon hole problem
Integers Integers: the set of whole numbers and their opposites.
Word Problems with Inequalities
How can values be expressed in multiple ways?
Warm Up – 3/17 - Monday A) List the set of vertices.
Pigeon-Hole Principle ( PHP )
The Pigeonhole Principle
the I was for to you said go and is can play we do like see
Presentation transcript:

PIGEONHOLE PRINCIPLE

So at least 1 hole contains at least 2 pigeons. Pigeonhole Principle If you place n + 1 objects in n holes, then at least one hole must contain more than one object. 9 holes, and 10 = 9 + 1 pigeons. So at least 1 hole contains at least 2 pigeons.

Socks You have a drawer full of black and white socks. Without looking in the drawer, how many socks must you pull out to be sure that you have a pair of the same colour? Trying to spice up your life, you go and buy a large number of red socks, green socks, and blue sock. Now how many must you pick out to be sure of having a pair of the same colour? Now, being of a mathematical persuasion, you have n different coloured socks in your drawer. Now how many must you pick to be sure of having a pair of the same colour?

Generalised PP If you have a number of objects inside some boxes, then there exists among them one box which contains an amount of AT LEAST # Objects # Boxes (rounded up)

More Socks A dog-owner has a drawer with her dog-socks in it. Each sock is either black or white. Presuming the dog has 4 legs, each of which needs a sock, how many must be taken from the drawer to ensure that the dog has 4 socks of the same colour? What if there are dog socks in all the colours of the rainbow, plus black and white – how many must be picked now to guarantee 4 socks of the same colour? Paul the Octopus has a drawer with socks, each of which is a colour featured on the German flag. How many socks must he pick in order to have 8 of the same colour?

Generalised PP backwards   Sub-optimum # objects/box

Examples How many people must be assembled to ensure that 10 of them were born on the same day of the week? (EGMO pre-selection test 2012) Show that, given any 5 whole numbers, you can always choose 3 whose sum is a multiple of 3. (SuperBrain test 2018) Seven darts are thrown at a circular dartboard of radius 10cm. Show that there will always be two darts that are at most 10cm apart. (EGMO selection test 2012) A doctor has a row of 16 chairs in her waiting room. What’s the least number of patients she must have to ensure that three consecutive chairs are filled?

General Comment The PP sounds pretty vague – it doesn’t tell you exactly how many objects are in any given box, it just gives a minimum for the number of objects in the fullest box. For example in Q1, you can’t say what day the 10 birthdays must be on, or whether there are more than ten birthdays on that day; you can only say that there must be some day with at least 10 birthdays on it.

General Comment The conclusion of the PP must be true no matter how the objects are arranged inside each box, as long as you have the right number of objects. It is often not enough to consider just 1 “worst case scenario” when just 1 object is missing, because there might be many different arrangements even among the “worst case scenarios”. For example in Q4, all these 3 cases can be considered “worst case scenarios”: We don’t know which of these the patients will choose. Choosing suitable boxes helps you treat all cases at once.

More Examples Show that at a party with 6 people, there are two people who know the same number of people at the party. Assume that “knowing someone” is a symmetric relation, i.e. if x knows y then y knows x (though may not be able to remember his name, which can be embarrassing). Given any 13 integers, show that there is a pair whose difference is divisible by 12. Given any 8 integers, show there is a pair whose sum, or difference, is divisible by 12.

Euler Circuits Can be drawn without raising the pen off the paper, without tracing over the same edge twice, and finishing where we started.

Euler Circuits Can be drawn without raising the pen off the paper, without tracing over the same edge twice, and finishing where we started. Each vertex must have an even number of neighbouring edges, because whenever you enter a vertex by one edge, you must exit by another edge. deg(A)=2 deg(B)=4 deg(C)=4 …………….

Application to Finances Each vertex represents a bank. Each edge AB represents a financial transaction: A client of bank A draws a mortgage of €200K and buys a house from a client of bank B, who deposits the €200K in his/her account in bank B. Because we’re in an Euler circuit, at the end of the day, none of the banks has spent any money. For each mortgage, the client owes the bank €200K + an interest of €100K payable over 20-30 years. In total, the 12 transactions will yield a gain of €1,200,000 in interest.

Application to Finances When a small set of players in an economy have unrestricted ability to create free money, this will lead to inequality. When the same players make decisions as to where to invest their money, this will lead to economical imbalances. Unrestricted, such a system will lead to crises. Banks and people are clearly on unequal terms. But how do the banks in an Euler circuit compare with each other? Q: Prove that for every simple Euler circuit, there always exist at least three vertices with the same degree. In our problem, at least three banks with gain the same amounts.