There is an infinitely long staircase. It has stairs numbered 1, 2, 3, ..., n, n+1, ..... You are standing at the bottom of it.
There are two identical crystall balls in your hand.
Its known that if either of the balls is rolled down from any stair that's N or lower, it will not break. If it is however rolled down from N+1 stair, or any stair higher than that, it will break.
Design a way to find the number N in smallest possible number of steps.
For the sake of argument, assume N is large
2007-04-10
05:59:10
·
5 answers
·
asked by
iluxa
5
in
Mathematics