home *** CD-ROM | disk | FTP | other *** search
- Comments: Gated by NETNEWS@AUVM.AMERICAN.EDU
- Path: sparky!uunet!gatech!paladin.american.edu!auvm!VUCTRVAX.BITNET!PARKERRA
- X-Envelope-to: stat-l@mcgill1.BITNET
- X-VMS-To: IN%"stat-l@mcgill1"
- MIME-version: 1.0
- Content-transfer-encoding: 7BIT
- Message-ID: <01GO2NX6GNCY8Y63CJ@ctrvax.Vanderbilt.Edu>
- Newsgroups: bit.listserv.stat-l
- Date: Thu, 27 Aug 1992 11:01:58 -0500
- Sender: "STATISTICAL CONSULTING" <STAT-L@MCGILL1.BITNET>
- From: PARKERRA@VUCTRVAX.BITNET
- Subject: Mai Wing's Solution
- Lines: 9
-
- I believe that there is a problem with your solution for P(1) [I have not
- worked through the other probabilities you give.] Specifically, the
- chance of picking any one specific clone each of N times is (1/8)^N. But there
- are 8 different specific clones that you could have gotten, so that P(1), the
- probability of only getting one clone is 8 * (1/8)^N, or (1/8)^(N-1).
-
- Note that if N = 1 P(1) must equal 1.
-
- Bob Parker
-