MAT 2377 Lecture Notes - Lecture 3: Sample Space
9 May 2014
School
Department
Course
Professor
Document Summary
Tree diagram: if the experiment can be described as a sequence of k steps, then the sample space can be illustrated with a tree. A path in this tree rep- resents an outcome. Example 12: we select an operator, say arthur, beatrice or celina, and we select one of two machines. Construct the tree diagram and list the possible outcomes. Remark: it is easy to build a tree, however it can become very large very fast. We will need a more e cient counting technique. Multiplication principle: if we can describe an experiment as a se- quence of k steps, and that the number of di erent ways to accomplish the ith task is ni, then. # of outcomes = n1 n2 nk. Let n be a non-negative integer, that is n = 0, 1, 2, . We de ne n (cid:40) n! factorial as follows n (n 1) (n 2) 1,
