lecture4 notes

# lecture4 notes - LECTURE 4 Discrete uniform law Readings...

This preview shows pages 1–2. Sign up to view the full content.

LECTURE 4 Discrete uniform law Readings: Section 1.6 Let all sample points be equally likely Then, Lecture outline number of elements of A A P ( A )= = | | total number of sample points Principles of counting | | Just count ... Many examples permutations k -permutations combinations partitions Binomial probabilities Basic counting principle Example r stages Probability that six rolls of a six-sided die n i choices at stage i all give di f erent numbers? Number of outcomes that make the event happen: Number of elements in the sample space: Number of choices is: n 1 n 2 ··· n r Answer: Number of license plates with 3 letters and 4 digits = if repetition is prohibited = Permutations: Number of ways of ordering n elements is: Number of subsets of { 1 ,...,n } = 1

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

View Full Document
Combinations Binomial probabilities ° n ± : number of k -element subsets k n independent coin tosses of a given n -element set P ( H )= p
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 2

lecture4 notes - LECTURE 4 Discrete uniform law Readings...

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

View Full Document
Ask a homework question - tutors are online