Lecture7__8211_Chapter2

Lecture7__8211_Chapter2 - Lecture 7 Chapter 2 Monday...

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

View Full Document Right Arrow Icon
Lecture 7 – Chapter 2 Monday, September 15 th
Image of page 1

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

View Full Document Right Arrow Icon
Counting Techniques Last lecture we have seen that if a set A contains N(A) simple events, and the total number of possible simple events is N then: It is easy to count this if number N is small. If N is large we have to use a technique to count all possible outcomes ( ) ( ) N A P A N =
Image of page 2