The Egg-Drop Numbers

Michael Boardman
2004 Mathematics Magazine  
Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.
more » ... l Association of America is collaborating with JSTOR to digitize, preserve and extend access to Mathematics Magazine. Each month, the mathematics students at Pacific University are given a challenge problem in what we call the "Pizza Problem of the Month." One of the most rewarding problems came from Which Way Did the Bicycle Go? [3, p. 53]: An egg-drop experiment We wish to know which windows in a thirty-six-story building are safe to drop eggs from, and which are high enough to cause the eggs to break on landing.... Suppose two eggs are available. What is the least number of egg-droppings that is guaranteed to work in all cases? To make this problem mathematical, the authors make some simplifying assumptions including * Eggs that survive can be used again and are not weakened. Eggs that break are history. * Eggs that break at a particular floor would break from higher floors as well. * Eggs that survive from a particular floor would survive from lower floors as well.
doi:10.2307/3219201 fatcat:3uwgfuwxrnfctlzjiil5zcge64