Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: 1...N puzzle
Replies: 27   Last Post: Nov 7, 1999 6:36 AM

 Messages: [ Previous | Next ]
 Jon Haugsand Posts: 26 Registered: 12/12/04
Re: 1...N puzzle
Posted: Nov 6, 1999 3:18 AM

* nvakil@gb-sam-ltsb-11.com
>
> I think the best guess is m = N/2 (integer) and then guess consecutive
> numbers from N/2 + 1 up to N and start from 1 to N.
>
> This way, if the hider's original guess is between N/2 and N then you hit it
> in less than N/2 times. However, if the original guess is less than N/2
> (integer) then total number of guesses is 1.5N.

Then you are guaranteed to end up with 1.5N. If you always start at 1
and carry upwards, you always end up with N guesses, clearly better.

--
Jon Haugsand
Norwegian Computing Center,
<mailto://Jon.Haugsand@nr.no> Pho: +47 22852608 / +47 22852500,
Fax: +47 22697660, Pb 114 Blindern, N-0314 OSLO, Norway

Date Subject Author
11/2/99 Eric Lehman
11/2/99 The Qurqirish Dragon
11/7/99 Eric Lehman
11/7/99 Fred Galvin
11/2/99 Virgil Hancher
11/2/99 John Roberts-Jones
11/2/99 Virgil Hancher
11/3/99 Fred Galvin
11/3/99 John Roberts-Jones
11/3/99 John Roberts-Jones
11/4/99 Fred Galvin
11/4/99 Fred Galvin
11/4/99 Fred Galvin
11/5/99 John Roberts-Jones
11/5/99 QSCGZ
11/5/99 John Roberts-Jones
11/6/99 QSCGZ
11/7/99 John Roberts-Jones
11/2/99 Fred Galvin
11/3/99 Eric Lehman
11/4/99 QSCGZ
11/4/99 Gruts
11/4/99 Gruts
11/5/99 Clive Tooth
11/5/99 nvakil
11/5/99 IEEE
11/6/99 Jon Haugsand
11/5/99 nvakil