When dropped from the f^{th} floor of a building, Bonanova's Brilliant Lightbulbs uniformly will break, but not if dropped from a lower floor. You are tasked with determining f using a nearby 1000-story building. Formulate an efficient strategy for determining f, and then request only as many BBLs as are needed to carry it out, covering the strategy's worst case.
Here's one strategy:
Drop a BBL from randomly chosen floors.
Worst case requires 1000 drops.
Ask for 1000 BBLs.
But you can do better.
What's thenumber of BBL's needed to determine f with the fewest number of drops?
You may assume that a 1000-story building is tall enough for this task.
Edited by bonanova Clearly state the strategy must be optimally efficient with respect to number of drops
Posted (edited)
Taking the up a few notches:
When dropped from the f^{th} floor of a building, Bonanova's Brilliant Lightbulbs uniformly will break, but not if dropped from a lower floor. You are tasked with determining f using a nearby 1000-story building. Formulate an efficient strategy for determining f, and then request only as many BBLs as are needed to carry it out, covering the strategy's worst case.
Here's one strategy:
Drop a BBL from randomly chosen floors.
Worst case requires 1000 drops.
Ask for 1000 BBLs.
But you can do better.
What's the number of BBL's needed to determine f with the fewest number of drops?
You may assume that a 1000-story building is tall enough for this task.
Edited by bonanovaClearly state the strategy must be optimally efficient with respect to number of drops
Share this post
Link to post
Share on other sites