Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

The Tower and Glass Marbles Problem

Richard T. Denman, David Hailey and Michael Rothenberg
The College Mathematics Journal
Vol. 41, No. 5 (November 2010), pp. 350-356
DOI: 10.4169/074683410x521946
Stable URL: http://www.jstor.org/stable/10.4169/074683410x521946
Page Count: 7
  • Download ($16.00)
  • Subscribe ($19.50)
  • Cite this Item
Item Type
Article
References
The Tower and Glass Marbles Problem
Preview not available

Abstract

Abstract The Catseye Marble company tests the strength of its marbles by dropping them from various levels of their office tower, to find the highest floor from which a marble will not break. We find the smallest number of drops required and from which floor each drop should be made. We also find out how these answers change if a restriction is placed on the number of marbles allocated for testing. Investigating this puzzle motivates algorithmic thinking, and leads to an interesting recursive solution.

Page Thumbnails