MathDB
Turkey TST 1992 - P5: m balls n boxes

Source:

March 13, 2011
inductioninequalitiescombinatorics proposedcombinatorics

Problem Statement

There are nn boxes which is numbere from 11 to nn. The box with number 11 is open, and the others are closed. There are mm identical balls (mnm\geq n). One of the balls is put into the open box, then we open the box with number 22. Now, we put another ball to one of two open boxes, then we open the box with number 33. Go on until the last box will be open. After that the remaining balls will be randomly put into the boxes. In how many ways this arrangement can be done?