Example class 1_solution

Example class 1_solution - Outline STAT 1301 Probability...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Outline STAT 1301 Probability and Statistics I Example Class 1 Department of Statistics and Actuarial Science, University of Hong Kong cliu1221@hku.hk Sep. 10 - 15, 2007 Solution Sep. 10 - 15, 2007 1 / 9
Background image of page 1

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

View Full DocumentRight Arrow Icon
Outline Outline 1 Review 2 Question 1 3 Question 2 4 Question 3 Solution Sep. 10 - 15, 2007 2 / 9
Background image of page 2
Review Question 1 Question 2 Question 3 Review of Ch0 & Ch1 1 Notation: n ! = n · ( n - 1 ) ... 2 · 1, esp. 0 ! 1; ( n j ) = n ! j !( n - j )! . Solution Sep. 10 - 15, 2007 3 / 9
Background image of page 3

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

View Full DocumentRight Arrow Icon
Review Question 1 Question 2 Question 3 Review of Ch0 & Ch1 1 Notation: n ! = n · ( n - 1 ) ... 2 · 1, esp. 0 ! 1; ( n j ) = n ! j !( n - j )! . 2 Key words: ordered/unordered, with/without replacement, distinguishable, indistinguishable Solution Sep. 10 - 15, 2007 3 / 9
Background image of page 4
Review Question 1 Question 2 Question 3 Review of Ch0 & Ch1 1 Notation: n ! = n · ( n - 1 ) ... 2 · 1, esp. 0 ! 1; ( n j ) = n ! j !( n - j )! . 2 Key words: ordered/unordered, with/without replacement, distinguishable, indistinguishable 3 The binomial theorem : ( 1 + x ) n = n r = 0 ( n r ) x r , where | x | < 1 and ( n r ) is called binomial coefficient. Solution Sep. 10 - 15, 2007 3 / 9
Background image of page 5

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

View Full DocumentRight Arrow Icon
Review Question 1 Question 2 Question 3 Review of Ch0 & Ch1 1 Notation: n ! = n · ( n - 1 ) ... 2 · 1, esp. 0 ! 1; ( n j ) = n ! j !( n - j )! . 2 Key words: ordered/unordered, with/without replacement, distinguishable, indistinguishable 3 The binomial theorem : ( 1 + x ) n = n r = 0 ( n r ) x r , where | x | < 1 and ( n r ) is called binomial coefficient. 4 with replacement without replacement ordered n r n ( n - 1 ) ... ( n - r + 1 ) unordered ( n + r - 1 r ) ( n r ) Solution Sep. 10 - 15, 2007 3 / 9
Background image of page 6
Review Question 1 Question 2 Question 3 Question 1 (a) 2 Case: Ordered selection without replacement.
Background image of page 7

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

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 25

Example class 1_solution - Outline STAT 1301 Probability...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online