You have two Ostrich eggs and 15 floor building.
The goal is to find out how hard the eggs are by throwing them down from the building. (15 different heights you can choose from)
What is the minimum number of throws needed to find out for certain where they will break?

Question

You have two Ostrich eggs and 15 floor building. 
The goal is to find out how hard the eggs are by throwing them down from the building. (15 different heights you can choose from)
What is the minimum number of throws needed to find out for certain where they will break?

neer2890 · Answer

you can choose binary search algorithm here.
so the minimum number of throws is $$\log _{2}15$$

anonymous · Answer

Well the answer has to be an integer

neer2890 · Answer

you can take ceiling function to get an integer.

anonymous · Answer

This question I found in a competition book for 13-14  year-old students.
Maybe you will arrive to the correct answer, but it can be solved with only basic maths too

neer2890 · Answer

to be very certain:|dw:1404469402943:dw|