Question

You are given 2 Easter eggs. You have access to a 100-storey building. These eggs are either hard or very fragile, meaning you may or may not break them when they fall. Both eggs, are however, identical. You now are tasked with figuring out the highest floor you can drop the egg from without it breaking, you are only able to break 2 eggs in the process. How many drops will be needed?

Answer 1

Minimum 14...

Hope it helped u ☺️...

Follow me if u think it's worthful

Answer 2

solution:-

Let's say i take advantage of a section and scan formula with the segment size s. So,

d ( 100/ s + (s-1) ) = 0 [ this could provide the minima, i want '(s-1)' scans per section and there are '100/s' segments]

-

ds

=> -100 / s^2 + 1 = 0

=> s^2 = 100

=> s = 10

So in according to this i would like at the most nineteen drops. however the best answer will try this with 14th drops.

=============

@GauravSaxena01