You're cleaning up your little nephew's toy room. There are Ttoys on the floor and n empty toy storage boxes. You randomly throwtoys into boxes, and when you're done the box with the most toyscontains N toys.
(a)What is the smallest that N could be when T=2n+1?
(b) What is the smallest that N could be when T=kn+1?
(c)Now suppose that the number of toys T satisfies
TProve that when you are done cleaning there will be (at least)one pair of boxes that contain the same number of toys.
