Brainteasers · Weighing and search · Medium
Two glass spheres
A tower has 60 floors, numbered 1 to 60. You have two identical glass spheres. There is a highest floor from which a sphere survives being dropped; it breaks from every floor above that one and survives from every floor at or below it. That floor may be any from 1 to 60, or the spheres may break even from floor 1. A sphere that survives a drop is unharmed and can be dropped again; a broken one is gone. What is the smallest number of drops that is certain to determine the highest safe floor, however the drops turn out?
Answer and solution
Answer
11
Solution
With d drops the first sphere climbs d, then d − 1, then d − 2 floors, so that a break always leaves just enough drops to finish one floor at a time: d drops cover d(d + 1)/2 floors.
With d drops in hand the first drop can be no higher than floor d, since a break leaves d − 1 drops for the d − 1 floors below. If it survives, the next goes d − 1 floors higher, and so on, covering d + (d − 1) + … + 1 = d(d + 1)/2 floors. Ten drops cover 55 floors, short of 60; eleven cover 66. The answer is 11.