OpenEuphoria

re: Puzzle

• Posted by Don <eunexus at yahoo.com> Aug 10, 2004
• 372 views

> ) First drop is on 14: if it breaks,
> ) then dropping on 1-13 (at worst 13 drops)
> ) will find the right floor.
> ) If it doesn't break on 14, second drop
> ) is on 27: if it breaks, then dropping
> ) 15-26 (at worst 12 drops) will find the right floor.
> ) If it doesn't braek on 27, the third drop is on 39 . . .
> )
> ) The sequence of drops until the first
> ) ball breaks is 14, 27, 39, 50, 60, 69,
> ) 77, 84, 90, 95, 99
> )
> ) For b=2, the number of drops (d) for
> ) a given f  is the smallest d such that
> ) d*(d+1)/2 is greater than or equal to f.
> 
> Damn...

Thats one of the more interesting algos ive seen in a very long time.  I
just love these kind of puzzels =)  Of course im always wrong but its
good to stretch the mind once in awile.

I also love looking at all those interesting math proofs.  Like I always
found it striking in the least that it can be proven (more ways than one)
that
0.999... = 1


Don Phillips - aka Graebel
     National Instruments
     mailto: eunexus @ yahoo.com