1 The Pigeonhole Principle CS/APMA 202 Rosen section 4.2 Aaron Bloomfield.

Slides:



Advertisements
Similar presentations
The Pigeon hole problem
Advertisements

The Pigeonhole Principle College of Information Technology & Design
The Pigeonhole Principle
1 Sets CS/APMA 202, Spring 2005 Rosen, section 1.6 Aaron Bloomfield.
CS Discrete Mathematical Structures
Binomial Coefficients
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:
1 Discrete Math CS 2800 Prof. Bart Selman Module Counting Chapter 5, Rosen.
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
Given three points of a circle: (-1,1), (7,-3), (-2,-6).
Recursive Definitions Rosen, 3.4 Recursive (or inductive) Definitions Sometimes easier to define an object in terms of itself. This process is called.
1 Set Operations CS/APMA 202, Spring 2005 Rosen, section 1.7 Aaron Bloomfield.
1 Integers and Division CS/APMA 202 Rosen section 2.4 Aaron Bloomfield.
Recursive Definitions and Structural Induction
1 Sequences and Summations CS/APMA 202 Rosen section 3.2 Aaron Bloomfield.
Fall 2015 COMP 2300 Discrete Structures for Computation
The Pigeonhole (Dirichlet’s box) Principle
1 Partial Orderings Aaron Bloomfield CS 202 Rosen, section 7.6.
Discrete Maths Objective to introduce some of the counting rules (product, sum, subtraction, division, pigeonhole) through examples , Semester 2,
Midpoint and Distance Formulas Section 1.3. Definition O The midpoint of a segment is the point that divides the segment into two congruent segments.
1 Permutations and Combinations CS/APMA 202 Rosen section 4.3 Aaron Bloomfield.
Counting. Why counting  Determine the complexity of algorithms To sort n numbers, how many instructions are executed ?  Count the number of objects.
Counting. Product Rule Example Sum Rule Pigeonhole principle If there are more pigeons than pigeonholes, then there must be at least one pigeonhole.
1 Lecture 3 (part 2) Functions – Pigeonhole Principle Reading: Epp Chp 7.4.
1 Predicates and Quantifiers CS/APMA 202, Spring 2005 Rosen, section 1.3 Aaron Bloomfield.
1 Proof Strategies CS/APMA 202 Rosen section 3.1 Aaron Bloomfield.
September1999 CMSC 203 / 0201 Fall 2002 Week #8 – 14/16 October 2002 Prof. Marie desJardins.
1 Relations and Their Properties Rosen, section 7.1 CS/APMA 202 Aaron Bloomfield.
1 Growth of Functions CS/APMA 202 Rosen section 2.2 Aaron Bloomfield.
Rosen, Section 8.5 Equivalence Relations
1 Algorithms CS/APMA 202 Rosen section 2.1 Aaron Bloomfield.
1 Representing Relations Rosen, section 7.3 CS/APMA 202 Aaron Bloomfield.
Representing Relations
CSNB143 – Discrete Structure
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,
5.2 The Pigeonhole Principle
1 Basics of Counting CS/APMA 202 Rosen section 4.1 Aaron Bloomfield.
Discrete Structures Counting (Ch. 6)
Unit II Discrete Structures Relations and Functions SE (Comp.Engg.)
1 Applications of Number Theory CS/APMA 202 Rosen section 2.6 Aaron Bloomfield.
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.
Introduction Suppose that a password on a computer system consists of 6, 7, or 8 characters. Each of these characters must be a digit or a letter of the.
1 The Pigeonhole Principle CS 202 Epp section ??? Aaron Bloomfield.
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.
Section The Pigeonhole Principle If a flock of 20 pigeons roosts in a set of 19 pigeonholes, one of the pigeonholes must have more than 1 pigeon.
1 Closures of Relations Based on Aaron Bloomfield Modified by Longin Jan Latecki Rosen, Section 8.4.
CS/APMA 202 Spring 2005 Aaron Bloomfield. Sequences in Nature
Main Menu Main Menu (Click on the topics below) Pigeonhole Principle Example Generalized Pigeonhole Principle Example Proof of Pigeonhole Principle Click.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Section The Product Rule  Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters.
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Aaron Bloomfield CS 202 Rosen, section 7.4
The Pigeonhole Principle
Proof methods We will discuss ten proof methods: Direct proofs
The Pigeonhole Principle
Permutations and Combinations
Xuan Guo Lab 9 Xuan Guo
The Pigeonhole Principle
The Pigeonhole (Dirichlet’s box) Principle
The Pigeonhole Principle
The Pigeon hole problem
Presentation transcript:

1 The Pigeonhole Principle CS/APMA 202 Rosen section 4.2 Aaron Bloomfield

2 The pigeonhole principle Suppose a flock of pigeons fly into a set of pigeonholes to roost If there are more pigeons than pigeonholes, then there must be at least 1 pigeonhole that has more than one pigeon in it If k+1 or more objects are placed into k boxes, then there is at least one box containing two or more of the objects This is Theorem 1 This is Theorem 1

3 Pigeonhole principle examples In a group of 367 people, there must be two people with the same birthday As there are 366 possible birthdays As there are 366 possible birthdays In a group of 27 English words, at least two words must start with the same letter As there are only 26 letters As there are only 26 letters

4 Generalized pigeonhole principle If N objects are placed into k boxes, then there is at least one box containing  N/k  objects This is Theorem 2 This is Theorem 2

5 Generalized pigeonhole principle examples Among 100 people, there are at least  100/12  = 9 born on the same month How many students in a class must there be to ensure that 6 students get the same grade (one of A, B, C, D, or F)? The “boxes” are the grades. Thus, k = 5 The “boxes” are the grades. Thus, k = 5 Thus, we set  N/5  = 6 Thus, we set  N/5  = 6 Lowest possible value for N is 26 Lowest possible value for N is 26

6 Rosen, section 4.2, question 4 A bowl contains 10 red and 10 yellow balls a)How many balls must be selected to ensure 3 balls of the same color? One solution: consider the “worst” case One solution: consider the “worst” case Consider 2 balls of each color You can’t take another ball without hitting 3 Thus, the answer is 5 Via generalized pigeonhole principle Via generalized pigeonhole principle How many balls are required if there are 2 colors, and one color must have 3 balls? How many pigeons are required if there are 2 pigeon holes, and one must have 3 pigeons? number of boxes: k = 2 We want  N/k  = 3 What is the minimum N? N = 5

7 Rosen, section 4.2, question 4 A bowl contains 10 red and 10 yellow balls b)How many balls must be selected to ensure 3 yellow balls? Consider the “worst” case Consider the “worst” case Consider 10 red balls and 2 yellow balls You can’t take another ball without hitting 3 yellow balls Thus, the answer is 13

8 Rosen, section 4.2, question 32 6 computers on a network are connected to at least 1 other computer Show there are at least two computers that are have the same number of connections The number of boxes, k, is the number of computer connections This can be 1, 2, 3, 4, or 5 This can be 1, 2, 3, 4, or 5 The number of pigeons, N, is the number of computers That’s 6 That’s 6 By the generalized pigeonhole principle, at least one box must have  N/k  objects  6/5  = 2  6/5  = 2 In other words, at least two computers must have the same number of connections In other words, at least two computers must have the same number of connections

9 Rosen, section 4.2, question 10 Consider 5 distinct points (x i, y i ) with integer values, where i = 1, 2, 3, 4, 5 Show that the midpoint of at least one pair of these five points also has integer coordinates Thus, we are looking for the midpoint of a segment from (a,b) to (c,d) The midpoint is ( (a+c)/2, (b+d)/2 ) The midpoint is ( (a+c)/2, (b+d)/2 ) Note that the midpoint will be integers if a and c have the same parity: are either both even or both odd Same for b and d Same for b and d There are four parity possibilities (even, even), (even, odd), (odd, even), (odd, odd) (even, even), (even, odd), (odd, even), (odd, odd) Since we have 5 points, by the pigeonhole principle, there must be two points that have the same parity possibility Thus, the midpoint of those two points will have integer coordinates Thus, the midpoint of those two points will have integer coordinates

10 More elegant applications Not going over…

11 Quick survey I felt I understood the material in this slide set… I felt I understood the material in this slide set… a) Very well b) With some review, I’ll be good c) Not really d) Not at all

12 Quick survey The pace of the lecture for this slide set was… The pace of the lecture for this slide set was… a) Fast b) About right c) A little slow d) Too slow

13 Quick survey How interesting was the material in this slide set? Be honest! How interesting was the material in this slide set? Be honest! a) Wow! That was SOOOOOO cool! b) Somewhat interesting c) Rather borting d) Zzzzzzzzzzz

14 Today’s demotivators