Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 5/3/83; site trw-unix.UUCP
Path: utzoo!linus!philabs!seismo!hao!hplabs!sdcrdcf!trw-unix!pearlman
From: pearlman@trw-unix.UUCP (Laura Pearlman)
Newsgroups: net.math
Subject: Re: YAST (Yet Another Statistics Problem)
Message-ID: <445@trw-unix.UUCP>
Date: Wed, 21-Sep-83 20:53:51 EDT
Article-I.D.: trw-unix.445
Posted: Wed Sep 21 20:53:51 1983
Date-Received: Mon, 26-Sep-83 03:54:34 EDT
References: <2287@utcsrgv.UUCP>
Organization: TRW EDS, Redondo Beach, CA
Lines: 11


It doesn't matter which door you choose in the "Let's Make
a Deal" problem.

Proof:  Let S be the set of prizes behind the three doors.
By a theorem proved earlier in this newsgroup, all elements
of S are equal.  Thus all prizes are bad, and it doesn't
matter whether you switch or not.

	-- Laura Pearlman
	...{sdcrdcf,decvax}!trw-unix!pearlman