## Problem of the Day #107: Fireworks
*July 4, 2011*

*Posted by Saketh in : potd , trackback*

Mitchell’s preparations for Independence Day involve infinitely many wooden crates, each of which has a capacity of $1776$ rockets. He obtains some fireworks and distributes them among the crates.

Every minute, all crates packed past capacity will burst. When a crate bursts, each of its rockets is dispersed to a distinct un-bursted crate.

Determine the greatest number of fireworks for which the dispersal process is guaranteed to eventually terminate, regardless of initial distribution.

## Comments»

no comments yet - be the first?