lecture03-sep12

lecture03-sep12 - STAT 430 Probability Lecture 3 Fall 2007...

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

View Full Document Right Arrow Icon
STAT 430 Probability Lecture 3 Fall, 2007
Background image of page 1

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

View Full DocumentRight Arrow Icon
Review Sample spaces with equally likely outcomes. Counting techniques Product rule Permutation Combination
Background image of page 2
Properties A combinatorial Identity: The Binomial Theorem: An Identity: . 1 , 1 1 1 n k k n k n k n - + - - = . ) ( 0 k n k n k n y x k n y x - = = + . 2 0 n n k k n = =
Background image of page 3

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

View Full DocumentRight Arrow Icon
Multinomial A set of n distinct items is to be divided into r distinct groups of respective size n 1 , n 2 , …, n r , where Σ n i = n. How many different divisions are possible? These are called the multinomial coefficients. The Multinomial Theorem: = - - - - - r r r r n n n n n n n n n n n n n n n n n ,..., , ! ! !
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/19/2010 for the course STAT 431 taught by Professor Stroud during the Fall '08 term at UPenn.

Page1 / 15

lecture03-sep12 - STAT 430 Probability Lecture 3 Fall 2007...

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

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