Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10 beta 3/9/83; site cwruecmp.UUCP Path: utzoo!watmath!clyde!floyd!harpo!decvax!cwruecmp!rrrm From: rrrm@cwruecmp.UUCP (R Robertson + R McGuire) Newsgroups: net.math,net.puzzle Subject: closest neighbor prob. Message-ID: <1132@cwruecmp.UUCP> Date: Thu, 5-Apr-84 16:50:23 EST Article-I.D.: cwruecmp.1132 Posted: Thu Apr 5 16:50:23 1984 Date-Received: Sat, 7-Apr-84 04:28:53 EST Organization: CWRU Computer Engr. Cleveland, Ohio Lines: 23 A couple years ago or so OMNI magazine published a contest that went something like... "You randomly place a random number of points in a square. What is the probability that a point is its closest neighbor's closest neighbor?" Does anyone out there know... a) the answer to this problem? (It was published in a later issue of OMNI but I didn't get a chance to read it.) b) the method for solving the problem? c) how to generalize this problem to n dimensions? (ie points on a line,square,in a cube,...) Ryan McGuire (the rm of rrrm)