COUNTING

SAMPLE
Permutation POINTS
 It is an arrangement(distinct) of all or part of a set
of objects.
Theorem 1:
The number of permutations of n objects is n!
 COUNTING
SAMPLE
Permutation POINTS
e.g.6 In how many distinct arrangements can we arrange the
letters a, b and c?

n=3
n! = n(n-1)(n-2)…(2)(1)
n! = 3(3-1)(3-2) = 3(2)(1)
n! = 6
 COUNTING
SAMPLE
Permutation POINTS
Theorem 2:
The number of permutations of n objects taken
r at a time is
 COUNTING
SAMPLE
Permutation POINTS
e.g.7 In one year, three awards (research, teaching, and
service) will be given to a class of 25 graduate students in a
statistics department. If each student can receive at most one
award, how many possible selections are there?
n = 25 graduate students
r = 3 awards
 COUNTING
SAMPLE
Permutation POINTS
ENGAGE 3
e.g.8 A president and a treasurer are to be chosen from a
student club consisting of 50 people. How many different
choices of officers are possible if
a. There are no restrictions; 2,450
b. A will serve only if he is president; 2,258
c. B and C will serve together or not at all; 2,258
d. D and E will not serve together? 2,448
 COUNTING
SAMPLE
Permutation POINTS
Circular Permutations
 Permutations that occur by arranging objects in a circle.

Theorem 3:
The number of permutations of n objects
arranged in a circle is (n – 1)!
 COUNTING
SAMPLE
Permutation POINTS
Permutation of Indistinguishable Objects
Theorem 4:
The number distinct permutations of n things of
which n1 are one kind, n2 of a second kind, …, nk of
a kth kind is
 COUNTING
SAMPLE
Permutation POINTS
Theorem 4:
The number of ways of partitioning a set of n
objects into r cells with n1 elements in the first cell,
n2 elements in the second, and so forth, is
 COUNTING
SAMPLE
Permutation POINTS
e.g.9 In a college football training session, the defensive
coordinator needs to have 10 players standing in a row. Among
these 10 players, there are 1 freshman, 2 sophomores, 4 juniors,
and 3 seniors. How many different ways can they be arranged in
a row if only their class level will be distinguished?
 COUNTING
SAMPLE
Permutation POINTS
ENGAGE 4

e.g.10 In how many ways can 7 graduate students be assigned

to 1 triple and 2 double hotel rooms during a conference? 210

e.g.11 How many different letter arrangements can be made

from the letters in the word STATISTICS? 50,400
 COUNTING
SAMPLE
Combination POINTS
 The number of ways of selecting r objects from n
without regard to order.
 A combination is a partition with two cells, the one
cell contains the r objects selected and the other cell
contains the (n – r) objects that are left. The number
of such combinations, denoted by
 COUNTING
SAMPLE
Combination POINTS
Theorem 6:
The number of combinations of n distinct
objects taken r at a time is
 COUNTING
SAMPLE
Combination POINTS
e.g.12 A young boy asks his mother to get 5 Game-Boy cartridges
from his collection of 10 arcade and 5 sports games. How many
ways are there that his mother can get 3 arcade and 2 sports games?

To get 3 out of 10 arcade cartridges:

; n = 10; r = 3
 COUNTING
SAMPLE
Combination POINTS
e.g.12 A young boy asks his mother to get 5 Game-Boy cartridges
from his collection of 10 arcade and 5 sports games. How many
ways are there that his mother can get 3 arcade and 2 sports games?

To get 2 out of 5 sports cartridges:

; n = 5; r = 2
 COUNTING
SAMPLE
Combination POINTS
e.g.12 A young boy asks his mother to get 5 Game-Boy cartridges
from his collection of 10 arcade and 5 sports games. How many
ways are there that his mother can get 3 arcade and 2 sports games?

Therefore, to get 5-Game Boy cartridges from the

collection:
120 * 10 = 1,200 ways that his mother can get 3 arcade
and 2 sports game cartridges
QUIZ 1

Answer the following questions. Show your

solution.
1. How many distinct permutations can be made
from the letters of the word SOLVING?
2. How many of these permutations start with
letter L?
QUIZ 2

Answer the following questions. Show your

solution.
1. How many three-digit numbers can be
formed from the digits 0, 1, 2, 3, 4, 5, and 6
if each digit can be used only once?
2. How many are greater than 330?