Generalizations of the pigeonhole principle
A generalized version of this principle states that, if N discrete objects are to be allocated to k containers, then at least one container must hold no fewer than ?N / k? objects. Similarly, at least one container must hold no more than ?N/k? objects.
First question.
k = 4, We need to find N.
?N / 4? = 4
N should be minimum 13 to be ?13 / 4? = ?3.25? = 4
To verify, ?12 / 4? = ?3? = 3, So 12 is not going to work.
I'll give a little explanation.Second part,
There are 7 days in a week. Then we have 7 pigeonholes. So the answer should be 29.
k = 7, We need to find N.
?N / 7? = 5
N should be minimum 29 to be ?29 / 7? = ?4.14? = 5
To verify, ?28 / 7? = ?4? = 4, So 28 is not going to work.
k = 12, We need to find N.Third part,
There are 12 months in a year. So we have 12 pigeonholes. In order to have at least 2 students born in the same month we should have 13 students in the class.
?N / 12? = 2
N should be minimum 13 to be ?13 / 12? = ?1.083? = 2
To verify, ?12 / 12? = ?1? = 1, So 12 is not going to work.