This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: THE UNIVERSITY OF HONG KONG DEPARTMENT OF STATISTICS AND ACTUARIAL SCIENCE STAT1301 PROBABILITY AND STATISTICS I EXAMPLE CLASS 1 Review Combinatorial Analysis (a) Multiplication Principle (b) Selection of r from n distinct objects: With replacement Without replacement Ordered n r n P r = n ! ( n- r )! Unordered ( n + r- 1 r ) = ( n + r- 1)! r ! × ( n- 1)! ( n r ) = n ! r ! × ( n- r )! (c) Arrangement of n objects, with r distinct types. In other words, there are n 1 objects of type 1, n 2 objects of type 2, ..., n r objects of type r . (e.g. number of different letter arrangements can be formed using the letters STATISTICS.) n ! n 1 ! × n 2 ! × ··· × n r ! (d) Partition of n distinct objects into r distinct groups with specified size n 1 ,n 2 , ··· ,n r . (e.g. number of ways in dividing a class of 40 into groups of 10, 10 and 20.) n n 1 ,n 2 , ··· ,n r = n ! n 1 ! × n 2 ! × ··· × n r ! (e) Partition of n indistinguishable objects into r distinct groups (i.e. we only concern the number of objects in each group)....
View Full Document