Documente Academic
Documente Profesional
Documente Cultură
RB Astillero
LESSON OBJECTIVES:
State the fundamental principle of counting.
Give the formula of permutations of n things
taken r at a time.
Solve permutation problems.
Give the formula of combinations of n things
taken r at a time.
Solve combination problems.
RB Astillero
FUNDAMENTAL PRINCIPLE OF
COUNTING
If one event can occur in m ways and a
second event can occur in n ways, then both
events can occur in m n ways, provided the
outcome of the first event does not influence
the outcome of the second event.
Note: The fundamental principle of counting
can be extended to any number of events.
When the outcome of one event does not
influence the outcome of the other, such
events are said to be independent events.
RB Astillero
EXAMPLE 1:
A restaurant offers a choice of 2 salads, 6
main dishes, 4 side dishes, and 3 desserts.
How many different 4-course meals can be
selected?
Note: Four independent events are involved:
selecting a salad, selecting a main dish,
selecting a side dish, and selecting a dessert.
The first event can occur in 2 ways, the
second in 6 ways, the third in 4 ways, and the
fourth in 3 ways. Thus, there are
2 6 4 3 = 144 possible meals.
RB Astillero
EXAMPLE 2:
David has 6 books that he wishes to arrange on his
desk. How many different arrangements are possible?
Note: Six events are involved: selecting a book for
the first spot, selecting a book for the second spot,
and so on. The outcome of the first event does not
influence the outcome of the other events since one
book has already been chosen.
David has 6 choices for the first spot, 5 choices for
the second spot, 4 choices for the third spot, and so
on. Thus, there are
6 5 4 3 2 1 = 720 different arrangements for the
books.
RB Astillero
EXAMPLE 3:
How many different 7-digit telephone numbers are
possible if the first digit cannot be zero and no digit
may repeat?
Note: Our number system consists of 10 digits,
which are {0, 1, 2, 3, 4, 5, 6, 7, 8, and 9}. Since the
first digit cannot be a zero, then there are 9 choices
for the first digit, 9 choices for the second digit
since a zero can be used and no digits may repeat,
8 choices for the third digit, 7 choices for the fourth
digit, and so on. Thus, there are
9 9 8 7 6 5 4 =544,320 possible telephone
numbers.
RB Astillero
RB Astillero
There are:
4 ways of choosing the 1st letter
3 ways of choosing the 2nd letter
2 ways of choosing the 3rd letter
number of words = 4 x 3 x 2 = 24
RB Astillero
RB Astillero
EXERCISES:
How many different arrangements, each consisting of four
different letters, can be formed from the letters of the word
PERSONAL if each arrangement is to begin and end with a vowel?
Ans. 180
N = 3652 = 180
1.
RB Astillero
10
11
RB Astillero
12
PERMUTATIONS
Definition:
If P(n, r) denotes the number of permutations
of n elements taken r at a time with r n,
then
13
EXAMPLE 1:
Suppose that 7 people enter a swim meet.
Assuming that there are no ties, in how
many ways could the gold, silver, and
bronze medals be awarded?
Note: Since awards are to be made, order
is important. Thus, this would be treated as
a permutation.
RB Astillero
14
Therefore, there are 210 ways that the medals could be awarded.
RB Astillero
15
EXAMPLE 2:
In how many ways can 6 students be seated
in a row of 6 desks?
Note: This is a permutation because order is
important. That is, a student may wish to sit
in a particular seat or behind/in front of a
particular student.
RB Astillero
16
RB Astillero
17
THEOREMS ON
PERMUTATION
Theorem
2.1. The number of permutations of n
elements taken n (or all) at a time is nPn = n!.
Theorem 2.2. The number of permutations of n
distinct objects arranged in a circle is (n-1)!.
Theorem 2.3. The number of permutations of n
distinct objects arranged in a ring is (n-1)!/2.
Theorem 2.4. The number of permutations of n
things of which n1 are of a kind, n2 of a second
kind,, nk a kth kind is
Where n1 + n2 ++ nk = n
RB Astillero
18
EXERCISES:
1. In how many different ways can 5 students make a
selection of 1 book each from a shelf containing 15 books?
Ans. 360, 360
N = 15P5 = 360, 360
2. In how many different ways can the letters of the word E
Q U A T I O N be arranged without changing the place of
the consonants?
Ans. 720
N = (5!)(3!) = 720
3. In how many different orders can 5 persons be seated
about a round table?
Ans. 24
N=(5 1)! = 4! = 24
RB Astillero
19
20
COMBINATION
Definition:
If C(n, r) represents the number of
combinations of n elements taken r at a time
with r n, then
=
Other symbols used for combinations of n
things taken r at a time are and nCr.
RB Astillero
21
EXAMPLE 1:
How many different committees of 3 people
can be chosen to work on a special project
from a group of 7 people?
Note: Since the order in which the members
of the committee are chosen does not affect
the result, this is a combination.
RB Astillero
22
RB Astillero
23
EXAMPLE 2:
In how many different ways can a group of 3
people out of a group of 7 people be chosen
to work on a project if it has already been
decided that a certain person must work on
the project?
Note: This is still a combination but the
problem has been reduced to selecting 2
more people from the remaining 6 people.
RB Astillero
24
RB Astillero
25
THEOREMS ON
COMBINATION
Theorem
2.5. The combinations of n things
taken r at a time is equal to the combinations
of n things taken (n-r) at a time. Thus,
nCr = nCn-r
Theorem 2.6. 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 on, is
=
where n1 + n2 + +nr = n
RB Astillero
26
EXERCISES:
1. How many possible combinations can be drawn from a
6/55 lotto draw?
Ans. 28, 989, 675
N = 55C6 = 28, 989, 675
2. How many committees of 5 can be formed from 8
sophomores and 4 freshmen if each committee is to consist
of three sophomores and two freshmen?
Ans. 336
N = 8C34C2 = 336
3. In how many ways can a committee consisting of 3 men
and 2 women be chosen from 7 men and 5 women?
Ans. 350
N = 7C35C2 = 350
RB Astillero
27
28
29
RB Astillero
30