The Pigeon hole problem

Slides:



Advertisements
Similar presentations
The Pigeon hole problem
Advertisements

Tutorial 2: First Order Logic and Methods of Proofs
The Pigeonhole Principle
Practice Quiz 3 Recursive Definitions Relations Basic Counting Pigeonhole Principle Permutations & Combinations Discrete Probability.
COUNTING AND PROBABILITY
The Pigeonhole Principle
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.
Discrete Structures Chapter 5 Pigeonhole Principle Nurul Amelina Nasharuddin Multimedia Department.
The Pigeonhole Principle
Copyright © Zeph Grunschlag, Counting Techniques Zeph Grunschlag.
CSE115/ENGR160 Discrete Mathematics 04/10/12
1 Copyright M.R.K. Krishna Rao 2003 Chapter 5. Discrete Probability Everything you have learned about counting constitutes the basis for computing the.
Pigeonhole.
Methods of Proof Leo Cheung. A Quick Review Direct proof Proof by contrapositive Proof by contradiction Proof by induction.
Fall 2004COMP 3351 Standard Representations of Regular Languages Regular Languages DFAs NFAs Regular Expressions Regular Grammars.
Recursive Definitions Rosen, 3.4 Recursive (or inductive) Definitions Sometimes easier to define an object in terms of itself. This process is called.
1 Non-regular languages. 2 Regular languages Non-regular languages.
Math Olympiad Strategies
1 The Pigeonhole Principle CS/APMA 202 Rosen section 4.2 Aaron Bloomfield.
UNIT 3 MEASUREMENT AND DATA PROCESSING
Functions A B f( ) =. This Lecture We will define a function formally, and then in the next lecture we will use this concept in counting. We will also.
9/2/2015Discrete Structures1 Let us get into… Number Theory.
Fall 2015 COMP 2300 Discrete Structures for Computation
The Pigeonhole (Dirichlet’s box) Principle
PLAYING WITH NUMBERS. BASIC CONCEPTS The concept of playing with numbers is one of the most fundamental concepts in mathematics. NATURAL NUMBERS (N ):
1 Lecture 3 (part 2) Functions – Pigeonhole Principle Reading: Epp Chp 7.4.
Math 170 Project #11 Part 2 Jeffrey Martinez Bianca Orozco Omar Monroy.
September1999 CMSC 203 / 0201 Fall 2002 Week #8 – 14/16 October 2002 Prof. Marie desJardins.
Symmetry Problem What is the sum of the values 1 to 100? Hint: Look for the symmetry!
CS201: Data Structures and Discrete Mathematics I
The Pigeonhole Principle. The pigeonhole principle Suppose a flock of pigeons fly into a set of pigeonholes to roost If there are more pigeons than pigeonholes,
Discrete Structures Combinations. Order Doesn’t Matter In the previous section, we looked at two cases where order matters: Multiplication Principle –
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.
Factors & Number Theory
The Pigeonhole Principle Alan Kaylor Cline. The Pigeonhole Principle Statement Children’s Version: “If k > n, you can’t stuff k pigeons in n holes without.
1 The Pigeonhole Principle CS 202 Epp section ??? Aaron Bloomfield.
3/7/20161 Now it’s time to look at… Discrete Probability.
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,
Activity 1-12 : Multiple-free sets
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.
Main Menu Main Menu (Click on the topics below) Pigeonhole Principle Example Generalized Pigeonhole Principle Example Proof of Pigeonhole Principle Click.
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Order 2.11, 2.21, 2, 2.06, and 2.24 from least to greatest.
PIGEONHOLE PRINCIPLE.
The Pigeonhole Principle
Standard Representations of Regular Languages
CSE322 PUMPING LEMMA FOR REGULAR SETS AND ITS APPLICATIONS
The Pigeonhole Principle
5 Minute Math Place the following in increasing order: 1/4 7/12 3/4 3/6 Round each of the following to the indicated value: 39,455 (nearest hundred) 1,295.
PIGEONHOLE PRINCIPLE.
PIGEONHOLE PRINCIPLE.
CS 2210 Discrete Structures Counting
Significant Figures General Chemistry.
Follow me for a walk through...
Elementary Questions about Regular Languages
The Pigeonhole Principle
CS 220: Discrete Structures and their Applications
PIGEONHOLE PRINCIPLE.
The Pigeonhole (Dirichlet’s box) Principle
Counting techniques Basic Counting Principles, Pigeonhole Principle, Permutations and Combinations.
There is a five-digit number with all the digits different and all are greater than zero. It is a multiple of 4. If the ones digit is cancelled, then the.
The Pigeonhole Principle
Number systems.
Miniconference on the Mathematics of Computation
The Pigeonhole Principle
From the last time: gcd(a, b) can be characterized in two different ways: It is the least positive value of ax + by where x and y range over integers.
Presentation transcript:

The Pigeon hole problem

If k+1 objects are placed in k containers then one container must contain at least 2 objects Obviously!

The generalised pigeon hole principle If n objects are placed in k containers, then at least one container has n/k objects Note: x is the smallest integer greater than or equal to x i.e. round up (example: 3.001 becomes 4 )

example Given 100 people in a room, what is the minimum number of people that are born on the same month? What are the pigeonholes? What are the pigeons? What do we know? What can we think of? 100/12 = 8.333 = 9 If n objects placed in k containers, then at least one container has n/k objects

example What is the minimum number of students required to be sure that at least 6 will receive the same grades, of A, B, C, D, and F (fail!) 5 containers: the marks A, B, C, D, F At least 1 container has to have at least 6 students students/5 = 6  students = 26 Did you think the answer should have been 30? If n objects placed in k containers, then at least one container has n/k objects

More pigeon hole examples!

who know (are friendly with) the same number of people in the room. example You are in a room with 10 other people. There at least two people in the room who know (are friendly with) the same number of people in the room. Is this true? What do we know … about knowing people? It’s a pigeonhole problem … So what are the pigeonholes? What are the pigeons?

If A knows (is friendly with) B then B knows (is friendly with) A example You are in a room with 10 other people. There at least two people in the room who know the same number of people in the room If A knows (is friendly with) B then B knows (is friendly with) A The pigeonholes are the number of people a person knows The pigeonholes are then as follows 0 people who know nobody 1 people who know only 1 person 2 people who know 2 people … 10 people who know 10 people But wait! It aint possible to have someone who knows ten people at the same time as there is someone in the room that knows nobody! So, there can only be 10 pigeonholes! There are 11 people What do we know … about knowing people? It’s a pigeonhole problem … So what are the pigeonholes? What are the pigeons? So, it’s true!

exercise Let d be a positive integer greater than zero. Show that amongst d+1 (not necessarily consecutive) integers there are at least two with the same remainder when divided by d. Note: do not assume these integers are all different

exercise Let d be a positive integer greater than zero. Show that amongst d+1 (not necessarily consecutive) integers there are at least two with the same remainder when divided by d. the pigeon holes are the remainders there are at most d remainders 0,1,2,…,d-1 there are d+1 numbers these are our pigeons since we have d+1 numbers and d remainders at least 2 have the same remainder

example A bowl contains 10 red and 10 blue balls. A blindfolded woman selects balls at random, without replacement. (a) How many balls must she select to be sure of getting at least 3 balls of the same colour? we have 2 colours, red and blue these are our pigeon holes at least one pigeon hole must have at least 3 pigeons (coloured balls!) using the generalised pigeon hole principle n/k = 3 where n is the smallest number of pigeons required where k is the number of pigeon holes n/2 = 3  n = 5 note, we were not constrained by the number of balls!

exercise A bowl contains 10 red and 10 blue balls. A blindfolded woman selects balls at random, without replacement. (b) How many balls must she select to be sure of getting at least 3 blue balls?

exercise A bowl contains 10 red and 10 blue balls. A blindfolded woman selects balls at random, without replacement. (b) How many balls must she select to be sure of getting at least 3 blue balls? again, the colours correspond to our pigeon holes we have 2 pigeonholes she could select 10 red balls one after the other so she would then need to select 3 more therefore she must select 13 to be sure of getting 3 blue balls! Note: in this case it did matter that we started with 10 of each colour

fin