If n pigeons are assigned to m pigeonholes then one of the pigeonholes must contain at least ______ pigeons.

This question was previously asked in
DSSSB TGT Maths Male Subject Concerned- 23 Sep 2018 Shift 1
View all DSSSB TGT Papers >

Answer (Detailed Solution Below)

Option 1 :
Free
DSSSB TGT Social Science Full Test 1
200 Qs. 200 Marks 120 Mins

Detailed Solution

Download Solution PDF

Concept:

Extended Pigeonhole Principal:

It states that if n pigeons are assigned to m pigeonholes ( the number of pigeons is very large than the number of pigeonholes), then one of the pigeonholes must contain at least  pigeons. 

Proof:  We can prove this by the method of contradiction.

Assume that each pigeonhole does not contain more than [( n - 1 )/m) pigeons. Then, there will be at most  pigeons in all. This is in contradiction to our assumption.

Hence, for given m pigeonholes, one of these must contain at least  pigeons.

Latest DSSSB TGT Updates

Last updated on May 12, 2025

-> The DSSSB TGT 2025 Notification will be released soon. 

-> The selection of the DSSSB TGT is based on the CBT Test which will be held for 200 marks.

-> Candidates can check the DSSSB TGT Previous Year Papers which helps in preparation. Candidates can also check the DSSSB Test Series

Hot Links: teen patti master gold download teen patti gold download apk teen patti gold teen patti gold new version 2024 happy teen patti