Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site ucbvax.BERKELEY.EDU
Path: utzoo!watmath!clyde!burl!ulysses!ucbvax!ernie!tedrick
From: tedrick@ernie.BERKELEY.EDU (Tom Tedrick)
Newsgroups: net.math
Subject: Re: Probability Problem (reward!)
Message-ID: <10816@ucbvax.BERKELEY.EDU>
Date: Sun, 27-Oct-85 03:42:19 EST
Article-I.D.: ucbvax.10816
Posted: Sun Oct 27 03:42:19 1985
Date-Received: Mon, 28-Oct-85 03:23:38 EST
References: <511@aero.ARPA>
Sender: usenet@ucbvax.BERKELEY.EDU
Reply-To: tedrick@ernie.UUCP (Tom Tedrick)
Organization: University of California, Berkeley
Lines: 10

>We select n points from a 2-dimensional uniform distribution, say {0 to 1}
>in both x and y. Now we form the convex hull of these, and it will contain
>k of the points. What is the probability that k of the n points will be on
>the convex hull?

Ouch! Offhand that looks like a hard research problem
(worth more than $20). Has it been solved previously
by anyone?

  -Tom