754 CHAPTER 11 Probability Section 11.4 Fundamental Counting Principle If a first experiment has M distinct outcomes and a second experiment has N distinct outcomes, then the two experiments in that specific order have M N⋅ distinct outcomes. Tree Diagrams A list of all possible outcomes of an experiment is called a sample space. Tree diagrams are helpful in determining sample spaces. Examples 1–3, pages 691– 694 Examples 2 – 4, pages 692– 695 Section 11.5 OR and AND problems PAB PA PB PA B P A B P A P B ( or ) ( ) ( ) ( and ) ( and ) ( ) ( ) = + − = ⋅ Examples 1–3, pages 701– 704 Examples 4 – 6, pages 705– 707 Section 11.6 Conditional Probability P E E n E E n E ( ) ( and ) ( ) 2 1 1 2 1 = Examples 1–3, pages 713– 716 Section 11.7 The number of permutations of n items is n!. n n n n ! ( 1)( 2) (3)(2)(1) = − − Permutation Formula P n n r ! ( )! n r = − The number of different permutations of n objects where … n n n , , , r 1 2 of the objects are identical is n n n n ! ! ! ! r 1 2 Example 4, page 724 Examples 5–7, pages 724– 727 Example 8, page 728 Section 11.8, 11.9 Combination Formula C n n r r ! ( )! ! n r = − Examples 2 – 4, pages 734– 735 Examples 1 – 4, pages 739 – 741 Section 11.10 Binomial Probability Formula P x C p q ( ) ( ) n x x n x = − Examples 1 – 4, pages 747–750
RkJQdWJsaXNoZXIy NjM5ODQ=