Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized for You
we will pick new questions that match your level based on your Timer History
Track Your Progress
every week, we’ll send you an estimated GMAT score based on your performance
Practice Pays
we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
(N/A)
Question Stats:
25%
(02:08)
correct 75%
(02:57)
wrong
based on 4
sessions
History
Date
Time
Result
Not Attempted Yet
You are given two stones, and access to a 100-storey building. Both stones are identical. The aim is to find out the highest floor from which a stone will not break when dropped out of a window from that floor. If a stone is dropped and does not break, it is undamaged and can be dropped again. However, once a stone is broken, that’s it for that stone. If a stone breaks when dropped from floor n, then it would also have broken from any floor above that. If a stone survives a fall, then it will survive any fall shorter than that. How many minimum tries do you need to find from which floor the stone will start breaking?
1. 50 2. 25 3. 32 4. 15 5. 14
got it right, but still would like to know the ideas from others.
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
You are given two stones, and access to a 100-storey building. Bothstones are identical. The aim is to find out the highest floor from which a stone will not break when dropped out of a window from that floor. If a stone is dropped and does not break, it is undamaged and can be dropped again. However, once a stone is broken, that’s it for that stone. If a stone breaks when dropped from floor n, then it would also have broken from any floor above that. If an stone survives a fall, then it will survive any fall shorter than that. How many minimum tries do you need to find from which floor the stone will start breaking?
1. 50 2. 25 3. 32 4. 15 5. 14
got it right, but still would like to know the ideas from others.
Show more
Moderators: Is this a GMAT question?
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.