
There is a 100-story building. An egg dropped from a certain floor or higher breaks, and from lower floors it does not. You want to find the lowest floor where it breaks.
You have only 3 eggs. An egg that does not break can be picked up and used again. A broken egg cannot be used.
In the worst case, what is the fewest number of drops that will always find the lowest floor where an egg breaks?
If you get stuck, open the hints one at a time, in order.
With one egg, how many drops does the worst case need?
With three eggs, after the first drop, how many floors remain for two eggs?
Count how many floors n drops can cover.
In the worst case, what is the fewest number of drops that will always find the lowest floor where an egg breaks?
Choose the answer closest to the truth.
9
The answer is "9."
With 3 eggs and up to n drops, the number of floors you can cover is n + n(n−1)/2 + n(n−1)(n−2)/6. For n = 8 this is 92 floors; for n = 9 it is 129 floors. The smallest n that covers 100 floors is 9.
With 8 drops you can cover only 92 floors. 14 is the answer for two eggs.
Because you reuse the answer for two eggs (14) as it is.
The cases on this site are fictional puzzles created for entertainment. Any resemblance to real people, organizations or events is coincidental.
© Unsolved Files