This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Chapter 2. P1 With return: RR, RG, RB, GR, GG, GB, BR, BG, BB. Without return: RG, RB, GR, GB, BR, BG. P2 Sample space = { all finite sequences of 1...6 with 6 in the last position and without 6 in other positions } { all infinite sequences of 1...5 } . E n = { all sequences from the sample space of length n } S n =1 E n c = ( E 1 ) c = (Here n rolls are necessary... is understood as the experiment will last n or more rolls...) P3 EF = { 12 , 14 , 16 , 21 , 41 , 61 } , E F = { 11 , 12 , 13 , 14 , 15 , 16 , 21 , 23 , 25 , 31 , 32 , 34 , 36 , 41 , 43 , 45 , 51 , 52 , 54 , 56 , 61 , 63 , 65 } EF c = { 23 , 25 , 32 , 34 , 36 , 43 , 45 , 52 , 54 , 56 , 63 , 65 } ( EF c is understood as E ( F c )) EFG = FG = { 14 , 41 } P4 (a) 1 and 0 denote heads and tails respectively. (b) A = { 1 , 0001 , 0000001 ,... } , B = { 01 , 00001 , 00000001 ,... } , ( A B ) c = { 001 , 000001 , 000000001 ,..., 0000000000000000 ... } P7 Assume that the order of the members of the team is important. An outAssume that the order of the members of the team is important....
View
Full
Document
This note was uploaded on 10/27/2010 for the course MATH 351 taught by Professor Moumen,f during the Spring '08 term at George Mason.
 Spring '08
 Moumen,F

Click to edit the document details