This is a variation on a puzzle posted here last year.
You have 3 eggs which are identical. There is a building with N floors. You will conduct tests by dropping eggs from various floors to see if they will break. If you drop an egg and it breaks, you can't use again. But, if it doesn't break, it is as good as new and can be used again. You only have time for 6 tests.
What is the largest N, where you can still guarantee that you will determine the exact highest floor from which you can drop an egg without it breaking?
Question
Guest
This is a variation on a puzzle posted here last year.
You have 3 eggs which are identical. There is a building with N floors. You will conduct tests by dropping eggs from various floors to see if they will break. If you drop an egg and it breaks, you can't use again. But, if it doesn't break, it is as good as new and can be used again. You only have time for 6 tests.
What is the largest N, where you can still guarantee that you will determine the exact highest floor from which you can drop an egg without it breaking?
Link to comment
Share on other sites
19 answers to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.