Pigeonhole Principle [FULL PROOF] (Mathematics for CS)

In today's lesson we learn what the pigeonhole principle. We do this with cats, boxes and more! First we explore what it is, then offer some discussion (more details are from the full lecture or in my notes on Patreon) for how this has an equivalent formulation on functions. In more videos, we'll go through some examples of varying difficulty!

Time Stamps:
0:00 Opening and setup
2:52 Pigeonhole Principle (with proof)
9:40 It is non-constructive, here are some limitations of the pigeonhole principle
13:25 Pigeonhole Principle in terms of functions!
21:49 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:

Follow also at:

#ComputerScience
#mathematics
#combinatorics