This is a "cute" (?) one I remember seeing last year:
You live in a 36-story apartment building, and have access to a window
on each floor. You want to determine what is the highest floor from
which you can drop an egg without it breaking, but you have only two
eggs to experiment with. Your eggs are identical and well-behaved in
that if one breaks when dropped from a given floor, ALL will break when dropped from ANY floor at least that high. (Also, if one DOESN'T break
when dropped from a given floor, NONE will break when dropped from ANY
floor no higher than that.)
The question is: what is the LEAST number of "drops" needed to GUARANTEE knowledge of the highest floor from which you can drop an egg without it breaking?
Eric Farmer
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 399 |
Nodes: | 16 (2 / 14) |
Uptime: | 111:44:31 |
Calls: | 8,369 |
Calls today: | 8 |
Files: | 13,165 |
Messages: | 5,899,207 |