{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Example_class_1_slides

Example_class_1_slides - Example class 1 STAT1301...

Info icon This preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
Example class 1 STAT1301 Probability and Statistics I Chan Chi Ho, Chan Tsz Hin & Shi Yun September 14, 2011
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Information about tutors Tutors: Chan Chi Ho (MW515), Chan Tsz Hin (MW518) and Shi Yun (MW518) Emails: [email protected], [email protected], [email protected], respectively. Assignment: Put assignments in assignment box outside MW515. I Deadline of Assignment 1: Sep. 26th
Image of page 2
Information about tutors Tutors: Chan Chi Ho (MW515), Chan Tsz Hin (MW518) and Shi Yun (MW518) Emails: [email protected], [email protected], [email protected], respectively. Assignment: Put assignments in assignment box outside MW515. I Deadline of Assignment 1: Sep. 26th
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Information about tutors Tutors: Chan Chi Ho (MW515), Chan Tsz Hin (MW518) and Shi Yun (MW518) Emails: [email protected], [email protected], [email protected], respectively. Assignment: Put assignments in assignment box outside MW515. I Deadline of Assignment 1: Sep. 26th
Image of page 4
Review: Combinatorial Analysis Multiplication Principle: If an operation consists of a sequence of k separate steps of which the first can be performed in n 1 ways, followed by the second n 2 ways, and so on until the k th can be performed in n k ways, then the operation consisting of k steps can be performed by n 1 × n 2 × ... × n k = k i = 1 n i ways.
Image of page 5

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Review: Combinatorial Analysis (cont’d) I Selection of r from n distinct objects: 1 Ordered selection with replacement: Consider drawing r balls from n distinct balls. The total number of ways is n × n × ... × n | {z } r times = n r . 2 Ordered selection without replacement: Consider drawing r balls from n distinct balls without replacement. The total number of ways is n × ( n - 1 ) × ( n - 2 ) × ... × ( n - r + 1 ) = n ! ( n - r )! .
Image of page 6
Review: Combinatorial Analysis (cont’d) II 3 Unordered selection with replacement: Consider drawing r balls from n distinct balls with replacement and without regard to order. This is the same as placing r identical objects into n distinct containers (why?). The problem is the same as arranging the “0” and “|” in, say, 00 | 000 || 00 | 0 ||| 00 ..... | 0 || 0 | {z } r "0"s and n - 1 "|"’s The total number of ways is r + n - 1 r = ( r + n - 1 )! r !( n - 1 )! . 4 Unordered selection without replacement: Consider drawing r balls from n distinct balls without replacement and without regard to order. The total number of ways is n r = n ! r !( n - r )! .
Image of page 7

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Review: Combinatorial Analysis (cont’d) III 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.) Total number of ways is n ! n 1 ! × n 2 ! ×···× n r ! . 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.) Toal number of ways is n n 1 , n 2 , ··· , n r = n ! n 1 ! × n 2 ! ×···× n r ! .
Image of page 8
Review: Combinatorial Analysis (cont’d) IV Partition of n indistinguishable objects into r distinct groups (i.e.
Image of page 9

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern