Pigeon Hole Principle
Pigeon Hole Principle
Pigeon Hole Principle
Hello Everybody!
a)
b)
a)
BLACK WHITE
b)
Show that in a group of 13 people at least two of them have their birthdays in the same
month.
12 "Holes"
Let us suppose if possible that every hole contains less than k+1 pigeons. Then
obviously each hole would contain at most k pigeons right?
Now the total number of pigeons in this case = n(k) which is less than the given nk+1.
Simple Proof
CASE 1 :
CASE 2:
CASE 3:
CASE 4 :
CASE 1 :
CASE 2:
CASE 3:
CASE 4 :
Given 5 integers , show that two of them can be chosen whose difference is divisible by 4.
OR