Scribd
Upload
25 views

Lecture20 Pigeonhole

This document discusses the pigeonhole principle. [1] The pigeonhole principle states that if more objects (pigeons) are placed into fewer boxes (pigeonholes), then at least one box will contain multiple objects. [2] The document provides examples of applying the pigeonhole principle to problems involving students' birthdays and book shelves. [3] It also introduces the extended pigeonhole principle and provides additional examples solving for minimum requirements.

Uploaded by

SambitSatpathy
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
25 views

Lecture20 Pigeonhole

This document discusses the pigeonhole principle. [1] The pigeonhole principle states that if more objects (pigeons) are placed into fewer boxes (pigeonholes), then at least one box will contain multiple objects. [2] The document provides examples of applying the pigeonhole principle to problems involving students' birthdays and book shelves. [3] It also introduces the extended pigeonhole principle and provides additional examples solving for minimum requirements.

Uploaded by

SambitSatpathy
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

Discrete Mathematics

BCSC0010
Module 1

Pigeonhole Principle
Pigeonhole Principle
Pigeonhole Principle
• If n is a positive integer and n + 1 or more objects
(pigeons) are placed into n boxes (pigeonholes) , then
there will be at least one box containing two or more
of the objects.
Example

• Suppose a class contains 13 students, then at least two of the


students (pigeons) were born in the same month
(pigeonholes).

• Among 27 English words, at least 2 words begin with same


letter
Example
• Show that if any 20 people are selected then we may choose a subset
of 3 so that all 3 were born on the same day of the week.

• n=20
• k=7
• = =3
Example
• Show, if 9 books are to be kept at 4 shelves , there must be at least
one shelf which contain at least 3 books.

•= Pigeonhole= 4 shelves

Pigeon= no of books (9)


Example
• How many minimum books are to be kept at 4 shelves , there must be
at least one shelf which contain at least 3 books.

Pigeonhole= 4 shelves

Pigeon= no of books ?)
Extended Pigeonhole Principle
• If n pigeonholes are occupied by kn + 1 or more pigeons,
where k is a positive integer, then at least one pigeonhole is
occupied by k + 1 or more pigeons.
• exp
• n=3, k=2, kn+1=7 (pigeons)
• Then at least in one pigeonhole k+1=3, pigeon should be
there.
Example
• Find the minimum number of students in a class to be sure that 3
of them are born in the same month.

• Here the n = 12 months (pigeonholes)


• k + 1 = 3 so k = 2
• Hence, kn + 1 = 2.12+1
• =25 students (pigeons)
• Minimum students in class is 25 for three of them born in the same
month.
Example
• What is the minimum number of students required in a class to be
sure that at least 6 of them will receive the same grade , if there are 5
possible grades A,B,C,D and F

•
Example
• What is the minimum number of students required in a class to be
sure that at least 6 of them will receive the same grade , if there are 5
possible grades A,B,C,D and F

• n=5 (pigeonholes)
• K+1=6 (at least)
• => k=5
• Minimum requirement, K.n+1=5.5+1
• =26
Example
• Find the minimum number of students in a class to be sure that 4 out
of them are born in the same month.

•
Example
• Find the minimum number of students in a class to be sure that 4 out
of them are born in the same month.

• n=12 (pigeonholes)
• K+1=4
• => k=3
• Minimum requirement, K.n+1=3.12+1
• =37
Example
• Minimum card must be selected from a standard deck of 52 cards to
guarantee that at least three cards of the same suit are chosen?
 Club
 Diamond
 Heart
 Spades
Example

• n=4 (pigeonholes)
• K+1=3
• => k=2
• Minimum requirement, K.n+1=2.4+1
• =9
Example
• Minimum card must be selected from a standard deck of 52 cards to
guarantee that at least three cards of the same kind?
 Club
 Diamond
 Heart
 Spades
Example

• n=13 (pigeonholes)
• K+1=3
• => k=2
• Minimum requirement, K.n+1=2.13+1
• =27

You might also like