Statistical Sciences 2141A/B Lecture 6: Section 1.7
16 Oct 2018
School
Department
Professor
Document Summary
When various outcomes of an experiment are equally likely (the same probability is assigned to each simple event), the task of computing probabilities reduces to counting. They are, however, many experiments for which the effort involved in constructing and counting such a list of outcomes is prohibitive because n is quite large. Thus, we have some "counting rules" with which is is possible to compute probabilities without having to list the outcomes. These rules are also useful in many problems involving outcomes that are not equally likely. If experimental outcomes can form an ordered set and can be combined, we can apply a rule in order to determine the total number of outcomes. Continuing this idea, if there are k seperate stages to the experiment, then by extending this idea, the number of k- tuples is n = n1 n2 nk. A small university town has six restaurants, a theatre complex with four screens, and three clubs to go dancing.
