Pigeonhole principle exercises

1.2k Views Asked by At

I have an exam in combinatorics on Friday and the pigeonhole principle is a part of the material. Can someone give me a reference to a book with the hardest(!) questions on this material? Thank you very much, it can help me a lot!

1

There are 1 best solutions below

0
On

In the book 'Proofs From THE BOOK' by Aigner & Ziegler there is a chapter on combinatorics which contains some nice problems. Here's a neat problem from 'Combinatorics and Graph Theory' by Harris et al: Let $a_1, a_2, a_3 \dots a_n$ be a sequence of integers. Prove the existence of integers $1\le j\le k\le n$ such that $\sum_{i=j}^k a_i $ is a multiple of $n$.