home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #19 / NN_1992_19.iso / spool / bit / listserv / statl / 1412 < prev    next >
Encoding:
Text File  |  1992-08-27  |  940 b   |  24 lines

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