MATH 1131 Lecture Notes - Lecture 5: Sample Space, Royal Institute Of Technology
7 Feb 2018
School
Department
Course
Professor
Document Summary
4. 3 counting techniques: in an equally likely outcome experiment: Sn: certain rules can be used to count outcomes in an event and/or a sample space. There are n(s) = n1 n2 n3 nk outcomes in the sample space s. Solution: there are five slots to fill, one for each die. There are 7776 possible rolls, or outcomes, in the sample space: there are only six possible yahtzees: 11111, 22222, 33333, 44444, 55555, and 66666. Because all the outcomes are equally likely (fair dice), the probability of rolling a. For any positive whole number n, the symbol n! (cid:894)read (cid:862)n fa(cid:272)torial(cid:863)(cid:895) is defined (cid:271)y n! Given a collection of n different items, an ordered arrangement, or subset, of these items is called a permutation. The number of permutations of n items, taken at a time, is given by npr = n(n 1)(n 2) [n (r 1)]
