Counting Techniques

Probability Concepts
Antic, Erica
Buquel, Marvilyn
Gepila, Gianina Moira
Macaraig, Romeo
Tajima, Sachi
Ysla, Kevin

Business Statistics
TF 2:30-4:00pm
H-358
PERMUTATIONS
COMBINATIONS
AND
COUNTING TECHNIQUES
Computer Science, Statistics and Probability all involve
counting techniques which are a branch of mathematics
called combinatorics (ways to combine things). We'll be
introducing this topic in this section.
For dinner you have the following choices:
soup salad chicken hamburger prawns
icecream
t
ENTREES MAINS
DESSERTS
How many different combinations of meals
could you make?
We'll build a tree diagram to show all of
the choices.
prawns
prawns
Now to get all possible choices we
follow each path.
soup, chicken, ice cream
soup, chicken, t
soup, prawns, ice cream
soup, prawns, t
soup, hamburger, ice cream
soup, hamburger, t
salad, chicken, ice cream
salad, chicken, t
salad, prawns, ice cream
salad, prawns, t
salad, hamburger, ice cream
salad, hamburger, t
Notice the number of choices at each branch
2
choices
3
choices
2
choices
We ended up with 12
possibilities
2 3 2 = 12
Multiplication Principle of Counting
If a task consists of a sequence of choices in which there are p
selections for the first choice, q selections for the second choice, r
selections for the third choice, and so on, then the task of making
these selections can be done in different ways.
p q r .
If we have 6 different shirts, 4 different pants, 5
different pairs of socks and 3 different pairs of
shoes, how many different outfits could we
wear?
6 4 5 3 =
360
How many 4 digit can be formed on
the 26 letters of the english alphabet?
a. No repetition is allowed
b. Repitition is allowed

a. no. of ways = 26x25x24x23
= 358,800
b. no. of ways = 26x26x26x26
= 456,976
Factorial
The factorial of any integer n is
denoted by n! and is defined as:
n!=n(n-1)(n-2), 1
O! is defined = 1
The value of n! which may be read
factorial n or the factorial of n, is
obtained by multiplying all the integers
from 1 to n.
7! = 7.6.5.4.3.2.1
= 5040
2! 7! =(2.1)(7.6.5.4.3.2.1)
=(2)(5040)
10!+9!+9! =(10.9.8.7.6.5.4.3.2.1) +
(9.8.7.6.5.4.3.2.1 ) +
(9.8.7.6.5.4.3.2.1)
=3,628,800 + 362,880 +
362,880
=4,354,560
A permutation is an ordered arrangement
of r objects chosen from n objects.
For combinations order does not matter but for permutations it does.
There are three types of permutations.
The first is distinct with repetition.
This means there are n distinct
objects but in choosing r of them
you can repeat an object.
this means different
Let's look at a 3
combination lock with
numbers 0 through 9
There are 10 choices for the first number
There are 10 choices for the second number
and you can repeat the first number
There are 10 choices for the third number
and you can repeat
By the multiplication principle there are 10 10 10 = 1000 choices
Permutations: Distinct Objects with Repetition
The number of ordered arrangements of r objects
chosen from n objects, in which the n objects are
distinct and repetition is allowed, is n
r
This can be generalized as:
What if the lock had four choices for
numbers instead of three?
10
4
= 10 000
choices
The second type of permutation is distinct, without repetition.
Let's say four people have a race. Let's look at the possibilities of how they
could place. Once a person has been listed in a place, you can't use that
person again (no repetition).
First place would be
choosing someone from
among 4 people.
Now there are only 3 to
choose from for second
place.
1
st
2
nd
Now there are only 2
to choose from for
third place.
3
rd
4
th
Only one possibility for
fourth place.
Based on the multiplication principle: 4 3 2
1 = 24 choices
n
P
r
, means the number of ordered arrangements of r objects chosen from
n distinct objects and repetition is not allowed.
In the last example:
0! =
1
If you have 10 people racing and
only 1st, 2nd and 3rd place how
many possible outcomes are
there?
( )!
!
r n
n
P
r
n

=
( )
24
! 0
1 2 3 4
! 4 4
! 4
4
4
=

=

= P
( )
720
! 7
! 7 8 9 10
! 3 10
! 10
3
10
=

=

= P
A combination is an arrangement of r
objects chosen from n objects regardless
of order.
n
C
r
, means the number combinations of r objects chosen from n distinct
objects and repetition is not allowed.
Order doesn't matter here so the combination 1, 2, 3 is not different than 3, 2,
1 because they both contain the same numbers.
( )
|
|
.
|

\
|

=
r
n
r r n
n
C
r
n
or
! !
!
You need 2 people on your committee and you have 5 to choose from. You
can see that this is without repetition because you can only choose a person
once, and order doesnt matter. You need 2 committee members but it
doesn't matter who is chosen first. How many combinations are there?
( )
10
2 ! 3
! 3 4 5
! 2 ! 2 5
! 5
2
5
=

=

= C
The third type of permutation is involving n objects that are not distinct.
How many different combinations of letters in specific order (but not
necessarily English words) can be formed using ALL the letters in the word
REARRANGE?
The "words" we form will have 9 letters so we need 9 spots to place the letters.
Notice some of the letters repeat. We need to use R 3 times, A 2 times, E 2 times
and N and G once.
First we choose
positions for the
R's. There are 9
positions and we'll
choose 3, order
doesn't matter
9
C
3
That leaves
6 positions
for 2 A's.
R R R

6
C
2
A A
That leaves
4 positions
for 2 E's.

4
C
2
That leaves
2 positions
for the N.
E E

2
C
1
That leaves
1 position
for the G.
N G

1
C
1
84 15 6 2 1 = 15 120 possible "words"
Not Examinable.. Just for Fun
This can be generalized into the following:
Permutations Involving n Objects
That Are Not Distinct

1 2
1 2
1 2
The number of permutations of objects
of which are of one kind, are of a
second kind, . . ., and are of a th kind
is given by
!
! ! !
where
k
k
k
n
n n
n k
n
n n n
n n n n

= + + +
Concepts of Probability
Probability is a mathematical concept
that is used to measure the certainty
or uncertainty of occurrence of
statistical phenomenon.
Sample Point each possible
outcomes of the experiment from the
sample space
The total number of sample point in
the given sample space S is
symbolically denoted by n(S).
Find the sample space of two coin in the
event of getting two tail and two heads in
tossing a coin.
a. Let n
1
=number of possible outcomes of
the first coin
n
2
= number of possible outcomes of
the second coin
b. The event of getting two tails
A = {TT}
n(A)=1
c. The event of getting two heads
A = {HH}
n(A)=1
A box contains 7 blue, 5 red, 2 yellow
balls. If 2 balls are drawn from the box,
determine the number of sample points
of the following:

a. Sample space
b. The event of getting all blue
c. The event of getting 1 red and 1
yellow

a. Let S = event of drawing 3 balls from
the box
n(S)=
14
C
2
= 14! / 2!(14-2)! = 91

b. Let A = event of getting all blue balls
n(A) =
7
C
2
= 7! / 2!(7-2)! = 21

c. Let B = event of getting 1 red & 1
yellow
n(B) =
5
C
1
.
2
C
1

=5! / 1!(15-1)! . 2! / 1!(2-1)!
=5 . 2
= 10
Probability of Relative
Frequency


P(A) = number of times A occurred /
number of times experiment was
repeated
Matthew decides to try to estimate the
probability that toast lands butter-side-
down when dropped.He drops a piece
of buttered toast 50 times and
observes that it lands butter-side-
down 30 times. He wants to estimate
the probability that the toast lands
butter-side-down.

P(toast land butter-side-down) = 30 / 50
= 0.6 = 60%
Sarah tosses a coin 200 times. She
gets 108 heads and 92 tails. Find the
probability of getting heads.

P(getting heads) = 108 / 200 = 0.54 =
54%
Classical Probability
P(A) = n(A) / n(S)

Where:
n(A) = represents the number of sample
points in event A
n(S) = represents the number of sample
points in the sample space
If three coins are tossed find the event
of getting:
a. Two tails
b. Three heads
c. One tail and two head

{HHH, HHT, HTH, THH}
{TTT, TTH, THT, HTT}
n(S) = 2x2x2 = 8
a. n(A) = 3 {TTH, THT, HTT}

P(A) = 3 / 8 = .375 = 37.50%

b. n(B) = 1 {HHH}

P(B) = 1 / 8 = 0.125 = 12.50%

c. n(C) = 3 {HHT, HTH, THH}

P(C) = 3 / 8 = .375 = 37.50 %
In a deck of 52 cards, 5 card will be
drawn. What is the probability of getting:

a. 3 face card and 2 ace
b. 1 club and 4 spade
c. All hearts

n(S) =
52
C
5
= 2,598,960

a. n(A) =
12
C
3
.
4
C
2
= 220 . 6 = 1,320
P(A) = 1,320 / 2,598,960 = 11/21658 =
0.05%

b. n(B) =
12
C
1
.
12
C
4
= 12 . 495 = 5,940
P(B) = 5,940 / 2,598,960 = 0.23%

c. n(C) =
12
C
5
= 792
P(C) = 792 / 2,598,960 = 0.03%
Addition Rule
Two or more events are mutually
exclusive if they cannot occur
simultaneously. This means that only
one of two or more events can occur

P(A B) = P(A) + P(B)
or
P(A B) = n(A) / n(S) + n(B) / n(S)

A spinner has 4 equal sectors colored
yellow, blue, green, and red. What is the
probability of landing on red or blue after
spinning this spinner?

P(A) = P(B) =

P(A B) = P(A) + P(B)
= +
= 2/4 = 1/2

A glass jar contains 1 red, 3 green, 2
blue, and 4 yellow marbles. If a single
marble is chosen at random from the jar,
what is the probability that it is yellow or
green?

P(A) = 4/10 P(B) = 3/10

P(A B) = P(A) + P(B)
= 4/10+ 3/10
= 7/10

Addition Rule
Events are non-mutually exclusive
when two or more events can occur.

P(A B) = P(A) + P(B) - P(A B)
or
P(A B) = n(A) / n(S) + n(B) / n(S)
P(A B) / n(S)
A single card is chosen at random from
a standard deck of 52 playing cards.
What is the probability of choosing a
king or a club?

P(A) = 4/52 P(B) = 13/52
P(A B) = 1/52

P(A B) = P(A) + P(B) - P(A B)
= 4/52 + 13/52 1/52
= 16/52 = 4/13


In a math class of 30 students, 17 are
boys and 13 are girls. On a unit test, 4
boys and 5 girls made an A grade. If a
student is chosen at random from the
class, what is the probability of choosing a
girl or an A student?

P(A) = 13/30 P(B) = 9/30
P(A B) = 5/30

P(A B) = P(A) + P(B) - P(A B)
= 13/30 + 9/30 5/30
= 17/30