概率论英文课件：ch2_3 Counting Sample Points.pdfVIP

2.3 Counting Sample Points Example: How many outcome sequences are possible when a die is rolled three times? (6)(6)(6)= 216 1 1 Multiplication Rule (Theorem 2.1) If an operation can be performed n1 ways, and if for each of these a second operation can be performed n2 ways, then two operations can be performed together in n1 n2 ways. 2 2 Theorem 2.2 If an operation can be performed in n1 ways, and if for each of these a second operation can be performed n2 ways, and for each of the first two a third operation can be performed in n3 ways, and so forth, then the sequence of k operations can be performed together in n1 n2 …nk ways. Example: A computer system uses passwords that consist of five letters followed by a single digit. How many passwords are possible? 5 26 (10) Read Example 2.15 and Example 2.16, 33 3 3 Permutation: A permutation is an arrangement of a set of objects in a definite order. Example: The letters a, b, and c have 6 permutations. Theorem 2.3 The number of permutations of n distinct objects is n ! (called n factorial) Theorem 2.4 The number of permutations of n distinct objects taken r at a time is n! P = n (n-1)…(n - r +1) n r (n r)!