Professional Documents
Culture Documents
10th Edition
Chapter 4
Basic Probability
Chap 4-1
Learning Objectives
In this chapter, you learn:
Important Terms
Assessing Probability
X
number of ways the event can occur
T
total number of elementary outcomes
3. subjective probability
an individual judgment or opinion about the probability of occurrence
Sample Space
The Sample Space is the collection of all
possible events
e.g. All 6 faces of a die:
Events
Simple event
Joint event
Visualizing Events
Contingency Tables
Ace
Sample
Space
Total
Black
24
26
Red
24
26
Total
48
52
Tree Diagrams
Full Deck
of 52 Cards
Not Ace
Ca r
k
c
a
Bl
Re d C
Ac e
Not an Ace
Ace
ard
No t a n
24
2
Ace
24
Sample
Space
Visualizing Events
Venn Diagrams
Let A = aces
A U B = ace or red
example:
A = queen of diamonds; B = queen of clubs
example:
A = aces; B = black cards;
C = diamonds; D = hearts
Probability
Certain
0.5
Impossible
Type
Color
Red
Black
Total
Ace
Non-Ace
24
24
48
Total
26
26
52
Type
Color
2
2
4
52 52 52
Red
Black
Total
Ace
Non-Ace
24
24
48
Total
26
26
52
Event
B2
Total
A1
A2
Total
P(B1)
Joint Probabilities
P(B2)
P(A1)
Type
Color
Red
Black
Total
Ace
Non-Ace
24
24
48
Total
26
26
52
Dont count
the two red
aces twice!
Computing Conditional
Probabilities
P(A and B)
P(A | B)
P(B)
The conditional
probability of A given
that B has occurred
P(A and B)
P(B | A)
P(A)
The conditional
probability of B given
that A has occurred
No CD
Total
AC
0.2
0.5
0.7
No AC
0.2
0.1
0.3
Total
0.4
0.6
1.0
0.2857
P(AC)
0.7
Given AC, we only consider the top row (70% of the cars). Of these,
20% have a CD player. 20% of 70% is about 28.57%.
CD
No CD
Total
AC
0.2
0.5
0.7
No AC
0.2
0.1
0.3
Total
0.4
0.6
1.0
0.2857
P(AC)
0.7
All
Cars
.7
0
)=
AC
s
a
Do
e
hav s not
eA
P(A
C
C )
.2
.7
D
C
Has
D oe
s no
t .5
have
CD
.7
=0
.3
.2
.3
D
C
Has
D oe
s no
t .1
have
CD
.3
All
Cars
C
as
0
=
)
D
.4
Do
e
hav s not
eC
D P(C
D)
=0
.6
AC
s
a
H
.2
.4
D oe
s no
t .2
have
AC
(continued)
P(CD and AC) = 0.2
.4
AC
s
a
H
.5
.6
D oe
s no
t .1
have
AC
.6
Statistical Independence
P(A | B) P(A)
Multiplication Rules
Marginal Probability
Bayes Theorem
P(A | B i )P(B i )
P(B i | A)
P(A | B 1 )P(B 1 ) P(A | B 2 )P(B 2 ) P(A | B k )P(B k )
where:
Bi = ith event of k mutually exclusive and collectively
exhaustive events
A = new event that might impact P(Bi)
Conditional probabilities:
P(D|S) = 0.6
(prior probabilities)
P(D|U) = 0.2
P(D | S)P(S)
P(S | D)
P(D | S)P(S) P(D | U)P(U)
(0.6)(0.4)
(0.6)(0.4) (0.2)(0.6)
0.24
0.667
0.24 0.12
So the revised probability of success, given that this well
has been scheduled for a detailed test, is 0.667
Event
Prior
Prob.
Conditional
Prob.
Joint
Prob.
Revised
Prob.
S (successful)
0.4
0.6
(0.4)(0.6) = 0.24
0.24/0.36 = 0.667
U (unsuccessful)
0.6
0.2
(0.6)(0.2) = 0.12
0.12/0.36 = 0.333
Sum = 0.36
Counting Rules
Counting Rule 1:
kn
Counting Rules
(continued)
Counting Rule 2:
(k1)(k2)(kn)
Example:
Counting Rules
(continued)
Counting Rule 3:
n! = (n)(n 1)(1)
Example:
Your restaurant has five menu choices for lunch. How many
ways can you order them on your menu?
Answer: 5! = (5)(4)(3)(2)(1) = 120 different possibilities
Counting Rules
(continued)
Counting Rule 4:
n!
n Px
(n X)!
Example:
nPx
n!
5!
120
60 different possibilities
(n X)! (5 3)!
2
Counting Rules
(continued)
Counting Rule 5:
Example:
Cx
n!
5!
120
possibilities
10
different
X!(n X)! 3! (5 3)! (6)(2)
Chapter Summary