Generalized Pigeonhole Principle [PROOF & EXAMPLE] (Mathematics for Computer Science)
3Today we consider a generalization of the pigeonhole principle, that allows us to make a stronger claim about how many objects at least in some bin (as opposed to just at least two).
Time Stamps:
0:00 Opening and Generalized Pigeonhole Principle (n is strictly greater than m is not required)
3:30 Proof
6:37 Example Usage
10:28 Closing
Have a beautiful day!
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Patreon Supporters (Supporter Access!):
Eric R
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard
#computerscience
#mathematics
#combinatorics