Problem
Show the following: Pigeonhole principle strong form: Let be positive integers. If objects are put into boxes, then either the st box contains at least objects, or the nd box contains at least objects, . . ., or the th box contains at least objects.
How can you deduce the usual Pigeonhole principle from this statement?