MATH Club
Deven Gill
UIC
Some interesting pigeon hole problems
Abstract: The pigeon principle is a fundamental concept in combinatorics. Its applications are wide-reaching, extending well beyond the scope of combinatorics alone. The principle is summarized as follows: Given n+1 balls which we must distribute into n urns, there is at least one urn with two or more balls. A more general form states the following: Given n balls and k urns then there is at least one urn with at least ceiling(n/k) balls.
We'll look at a few applications of this principle to problems appearing in competition mathematics, number theory, and geometry. By the end of this talk, you should have acquired a sense of the pigeonhole principle's importance and utility.
Pizza, while supplies last
Monday November 6, 2023 at 1:00 PM in 636 SEO