You have two eggs to find out the maximum height from which an egg can be dropped from a building of 100 floors so that it does not break. The aim is to get the required height in the minimum possible number of trials.
If an egg breaks when dropped from floor n, then it would also have broken from any floor above that. If an egg survives a fall, then it will survive any fall shorter than that. The question is: What strategy should you adopt to minimize the number egg drops it takes to find the solution?. (And what is the worst case for the number of drops it will take?)there are no tricks, gotchas or other devious ruses. Don’t rat-hole with issues related to terminal velocity, potential energy or wind resistance. This is a math puzzle plain and simple. Think about the puzzle for a few minutes,
n + (n-1) + (n-2) + (n-3) + (n-4) + … + 1 >= 100 This summation, as many will recognize, is the formula for triangular numbers (which kind of makes sense, since we’re reducing the step by one each drop we make) and can be simplified to: n (n+1) / 2 >= 100 This is a quadratic equation, with the positive root of 13.651 (Which we have to round up to 14. This is not a John Malkovich movie!).
did it help
i kinda jut said all that lol wow
@i_suck_at_school Thank YOU. Greatly Appreciated!
Join our real-time social learning platform and learn together with your friends!