Pigeonhole principle for boxes

75 Views Asked by At

Let $n$ be a positive integer. How to prove that if $5n + 1$ objects are distributed in $n$ boxes then some boxes must contain at least $6$ objects?

I think I have to use the pigeonhole principle but I don't know how to use it.

1

There are 1 best solutions below

0
On

If by contradiction all boxes contain at most $5$ objects then there would be at most $5n$ objects in total. (This is indeed some "generalized" version of the pigeonhole-principle)