Calvin has *three* distinct eggs, one of which is made of rubber and thus cannot break; unfortunately, *he doesnâ€™t know which egg is the rubber one*.

Further, in some 100-story building there exists a floor such that all normal eggs dropped from below that floor will not break, while those dropped from at or above that floor will break and cannot be dropped again.

What is the minimum number of times Calvin must drop an egg to determine the floor satisfying this property?

×

Problem Loading...

Note Loading...

Set Loading...