Chapter 3 Probability Concepts
Chapter 3 Probability Concepts
Statistics
HK 01
Probability Concepts
3
1
2.
3.
4.
5.
6.
7.
P(~ ) = 1 - P(A)
Assessing Probability
Classical Probability:
Counting Occurrence in a sample space
Subjective Probability
Based on Experience, not calculation
Assessing Probability
Classical Probability:
10
Assessing Probability
Relative Frequency Probability:
11
Assessing Probability
DEMONSTRATION OF THE RELATIVE FREQUENCY NOTION OF PROBABILITY
Suppose I toss two fair dice and I'm interested in the probability that the sum of the
two faces is equal to 6. I can use the computer to simulate this experiment a large
number of times. As I simulate dice rolls, I keep track of the number of "sums of 6" I
observe and the relative frequency
Number of sixes
--------------- .
Number of tosses
In the computer I toss two dice 1000 times. On the graph below, I plot the relative
frequency of "sum of 6" against the number of experiments.
12
Assessing Probability
Note that there is a lot of variation in the relative frequencies for a few
experiments. As I toss the dice more times, the relative frequencies
appear to settle down. I would guess from the graph that the true
probability that I get a sum equal to 6 is just under .15. In fact, the
actual probability is equal to .139.
13
Assessing Probability
Subjective Probability:
14
15
16
17
Example
Suppose, for instance, that a customer wishes to buy a new cell
phone and can choose from n1 = 5 brands, n2 = 5 sets of
capability, and n3 = 4 colors. These three classifications result in
n1n2n3 = (5)(5)(4) = 100 different ways for a customer to order
one of these phones.
18
A permutation
A permutation is an arrangement of all or part of a set
of objects.
Consider the three letters a, b, and c. The possible
permutations are abc, acb, bac, bca, cab, and cba. Thus,
we see that there are 6 distinct arrangements
There are n1 = 3 choices for the first position. No
matter which letter is chosen, there are always n2 = 2
choices for the second position. No matter which two
letters are chosen for the first two positions, there is
only n3 = 1 choice for the last position, giving a total
of n1n2n3 = (3)(2)(1) = 6 permutations
19
A permutation
A permutation
we have two positions to fill, with n1 = 4 choices for the
first and then n2 = 3 choices for the second, for a total
of n1n2 = (4)(3) = 12 permutations. In general, n
distinct objects taken r at a time can be arranged in
n(n 1)(n 2) (n r + 1) ways.
We represent this product by the symbol
.
21
A permutation
22
A permutation
Example 1
Consider arranging 3 letters: A, B, C. How many ways can this be done?
Solution 1
The possible permutations are
ABC, ACB,
BAC, BCA,
CAB, CBA.
Hence, there are six distinct arrangements.
Another way of looking at this question is by drawing 3 boxes.
Any one of the A, B, C goes into the first box (3 ways to do this), and then the
remaining one of the two letters goes into the second box (2 ways to do this),
and the last remaining letter goes into the third box (only one way left to do this).
Hence, total no of ways 321=6
23
A permutation
Example
24
A permutation
Permutations of Different Kinds of Objects
25
A permutation
Example
In how many ways can the six letters of the word
"mammal" be arranged in a row?
Solutions
Since there are 3 "m"s and 2 "a"s in the word "mammal", we have:
6!3!2!=60
There is one "L" in "mammal", but it does not affect the answer, since 1! = 1
26
A permutation
Example
In how many ways can a supermarket manager display 5 brands of cereals
in 3 spaces on a shelf?
Solution
27
Combinations
about
28
Combinations
Example
Consider the selection of a set of 4 different letters from the
English alphabet.
Suppose
David selected A, E, R, T;
Karen selected D, E, N, Q; and
John selected R, E, A, T
Note: David and John selected the same set of letters, even though
they selected them in different order. Hence, these 3 people have
selected only 2 different sets of 4 letters (not 3 sets!!).
29
Combinations
In many problems, we are interested in the number of
ways of selecting r objects from n without regard to
order.
30
Combinations
Evaluate
C6.
8 7 6 5 4 3
Solution. C6 =
= 28.
1 2 3 4 5 6
8
31
Combinations
Evaluate
C6.
8 7 6 5 4 3
Solution. C6 =
= 28.
1 2 3 4 5 6
8
32
Combinations
33
Combinations
Example
34
Combinations
Example
There are 12 people entering a room where there are only 10 chairs. How
many ways can two people be chosen to remain standing?
35
Combinations
Example
There are 12 people entering a room where there are only 10 chairs. How
many ways can two people be chosen to remain standing?
36
Combinations
Example
Out of 5 mathematicians and 7 engineers, a
committee
consisting
of
2 mathematicians
and 3 engineers is to be formed. In how many ways
can this be done if
Combinations
Example
38
Tree Diagram
A tree diagram is simply a way of representing a sequence of
events. Tree diagrams are particularly useful in probability since
they record all possible outcomes in a clear and uncomplicated
manner.
39
Tree Diagram
We can extend the tree diagram to two tosses of a coin:
40
Tree Diagram
How do we calculate the overall probabilities?
- We
41
Tree Diagram
Now we can see such things as:
- The
42
Tree Diagram
That
was
a
simple
example
using independent events (each toss of a
coin is independent of the previous toss),
but tree diagrams are really wonderful for
figuring out dependent events (where an
event depends on what happens in the
previous event) like this example:
43
Tree Diagram
Picturing the Probabilities
Imagine I roll an ordinary die three times, and I'm interested in the
probability of getting number six. I might draw a tree diagram like this:
44
Tree Diagram
Picturing the Probabilities
Imagine I roll an ordinary die three times, and I'm interested in the
probability of getting one, two or three sixes. I might draw a tree diagram
like this:
45
Tree Diagram
Check that you agree with the probabilities at the end of each branch before
reading on.
We can now work out:
1/216
P(three sixes) = 1216
P(exactly two sixes) = 15216
15/216
75/216
P(exactly one six) = 75216
125/216
P(no sixes) = 125216
46
Tree Diagram
Tree Diagram
Let's build the tree diagram. First we show the two possible coaches: Sam or
Alex:
The probability of getting Sam is 0.6, so the probability of Alex must be 0.4
(together the probability is 1)
Now, if you get Sam, there is 0.5 probability of being Goalie (and 0.5 of not
being Goalie):
48
Tree Diagram
If you get Alex, there is 0.3 probability of being Goalie (and 0.7 not):
The tree diagram is complete, now let's calculate the overall probabilities. This
is done by multiplying each probability along the "branches" of the tree.
Here is how to do it for the "Sam, Yes" branch:
49
Tree Diagram
(When we take the 0.6 chance of Sam being coach and include the 0.5 chance
that Sam will let you be Goalkeeper we end up with an 0.3 chance.)
But we are not done yet! We haven't included Alex as Coach:
50
Tree Diagram
0.3 + 0.12 = 0.42 probability of being a Goalkeeper today
(That is a 42% chance)
Check
One final step: complete the calculations and make sure they add to 1:
Conclusion
So there you go, when in doubt draw a tree diagram, multiply along the
branches and add the columns. Make sure all probabilities add to 1 and you are
good to go.
51
Probability Concepts
Now you are qualified use Probability Concepts!
The factorial 69! Is the largest factorial most calculator can handle
52