MATH

TIME!
PERMUTATI
ONS
should
should be be able
able to:
to:
a.
a. Determine
Determine situation
situation or
or task
task which
which
describes
describes permutation.
permutation.
b.
b. Illustrates
Illustrates the
the permutation
permutation ofof objects.
objects.

c.
c. Derives
Derives the
the formula
formula for
for finding
finding the
the
number
number of of permutations
permutations ofof nn objects
objects
taken
taken rr at
at aa time.
time.
d.
d. Solves
Solves problems
problems involving
involving
permutations.
permutations.
Suppose Randolf, Deo and Angelo were riding on a bus and
there were 3 vacant seats in a row. In how many ways can they
arrange their selves?
 ARRANGEMENTS

RANDOLF DEO ANGELO

RANDOLF ANGELO DEO

DEO RANDOLF ANGELO

DEO ANGELO RANDOLF

ANGELO RANDOLF DEO

ANGELO DEO RANDOLF

 In
In performing
performing aa certain
certain task
task
where
where order
order or
or arrangement
arrangement is is
important,
important, each
each possible
possible
arrangement
arrangement is is called
called aa
permutation.
permutation.
A
A permutation
permutation is is an
an arrangement
arrangement
of
of things
things in
in aa definite
definite order
order or
or the
the
ordered
ordered arrangement
arrangement of of
distinguishable
distinguishable objects
objects without
without
allowing
allowing repetitions
repetitions among
among thethe
objects.
objects.
integer,
integer, then
then nn factorial
factorial
denoted
denoted by by n!
n! is
is the
the product
product of of
all
all integers
integers less
less than
than oror equal
equal to to
n.
n.
n!
n! == n·
n· (n
(n –1)
–1) ·· (n
(n –2)
–2) ·· ...
... ·· 2
2 ·· 1
1

As
As aa special
special case,
case, we
we define
define 0!
0!
=
=1 1
Suppose Randolf, Deo and Angelo were riding on a bus and
there were 3 vacant seats in a row. In how many ways can they
arrange their selves?
Solution:
Solution:
3!
3! =
=
=
=66

Therefore,
Therefore, there
there are
are 6
6 different
different
ways
ways you
you can
can arrange
arrange yourself
yourself
in
in the
the three
three vacant
vacant seats.
seats.
A mobile phone requires a 4-
digit pin to unlock the phone.
In how many ways can you
arrange the 4 digit pins?
Solution:
4! =
= 24

Therefore, there are 24

different ways we can
arrange the pins to unlock a
phone.
THIS!
Compute:
a. 7!
b.
c. 4!5!
Solution:
Solution:

a.
a. 7!
7!
7!
7! ==
=
= 5040
5040
Solution:
Solution:

b.
b.
=
=
=
=
=
= 56
56
Solution:
Solution:

c. 4!5!
c. 4!5!
4!5! =
4!5! = ()
()
=
=
=
= 2880
2880
 P(n,
P(n, r)
r) -- the
the number
number of of
permutations
permutations thatthat can
can be
be made
made
with
with nn things
things taken
taken rr at
at aa time.
time.

It
It can
can also
also be
be donated
donated as
as PPrr ,, or
or
The
The number
number of of permutations
permutations of of nn things
things
taken
taken nn at
at aa time
time is
is given
given by:
by:
P(n,
P(n, n)=
n)= n!
n!
The
The number
number of of permutations
permutations of of nn things
things
taken
taken rr at
at aa time
time is
is given
given by:
by:
P(n,
P(n, r)
r) =
= where
where rr << nn
LE:
Compute:

a. P(7, 7)
b.P(8, 5)
Solution:
Solution:

a.
a. P(7,
P(7, 7)
7)
P(7,
P(7, 7)
7) =
= 7!
7!
P(7,
P(7, 7)
7) =
=
== 5040
5040
Solution:
Solution:
b.
b. P(8,
P(8, 5)
5)
P(n,
P(n, r)
r) =
=
P(8,
P(8, 5)
5) ==
P(8,
P(8, 5)
5) ==
=
= 6720
6720
Suppose we have 6 different potted plants
and we wish to arrange 4 of them in a row.
In how many ways can this be done?

The permutation of 6 potted plants taken

4 at a time is denoted by P(6, 4).
Solution:
Solution:
P(6,
P(6, 4)
4)
P(n,
P(n, r)
r) =
=
P(6,
P(6, 4)
4) =
=
P(6,
P(6, 4)
4) =
=
=
= 360
360
 ABLE
PERMUTATION
S
 Distinguishable
Distinguishable permutations
permutations ––
refers
refers toto the
the permutations
permutations of of aa set
set of
of
objects
objects where
where some
some of of them
them are
are alike.
alike.
The
The number
number of of distinguishable
distinguishable
permutations
permutations of of nn objects
objects when
when pp areare
alike,
alike, qq are
are alike,
alike, rr are
are alike,
alike, and
and soso on,
on,
is
is given
given by
by the
the formula:
formula:

PP =
=
 LE:
Find
Find the
the number
number ofof
distinguishable
distinguishable permutations
permutations of
of
the
the letters
letters in
in each
each word.
word.

a.
a. BASKETBALL
BASKETBALL
b.
b. HETEROGENEOUS
HETEROGENEOUS
Solution:
Solution: BASKETBALL
BASKETBALL
There
There isis aa total
total of
of 10
10 letters
letters in
in the
the word
word
basketball
basketball but but there
there areare 22 b’s,
b’s, 22 a’s,
a’s, and
and 22 l’s.
l’s. The
The 22
b’s,
b’s, 22 a’s,
a’s, and
and 22 l’s
l’s can
can be
be permuted
permuted as as 2!,
2!, 2!,
2!, and
and 2!
2!
ways
ways respectively,
respectively, in in each
each permutation
permutation without
without
altering
altering the
the result.
result. Hence,
Hence, thethe number
number of of
distinguishable
distinguishable permutation
permutation is is given
given by:
by:
PP =
=
PP =
=
PP =
=
PP =
= = = 453600
453600
Solution:
Solution: HETEROGENEOUS
HETEROGENEOUS
There
There are
are 13
13 letters
letters in
in the
the word
word
“heterogeneous”
“heterogeneous” butbut there
there are
are 44 e’s
e’s and
and 22
o’s.
o’s. Hence,
Hence, the
the number
number ofof permutations
permutations is is
given
given by:
by:
PP =
=
PP =
=
PP =
=
PP =
= = = 129729600
129729600
 CIRCULAR
PERMUTATION
S
Circular
Circular permutation
permutation –– the the
different
different possible
possible
arrangements
arrangements of of objects
objects in
in aa
circle.
circle. The
The number
number of of
permutations,
permutations, P, P, of
of n
n objects
objects
around
around aa circle
circle is
is given
given by
by

P
P== (n
(n –1)!
–1)!
 LE:
In how many ways
can 5 persons be
seated around a
circular table?
 LE:
Find the number of
different ways that a
family of 8 can be
seated around a
circular table.
Solution:
Solution:
This
This is
is circular
circular permutation
permutation of
of 5
5
things.
things. Therefore,
Therefore, there
there are:
are:
PP =
= (n
(n –1)!
–1)!
=
= (5
(5 –1)!
–1)!
=
= 4!
4!
=
= 4·3·2·1
4·3·2·1
=
= 24
24 ways
ways
1.
1. How
How many
many distinguishable
distinguishable permutations
permutations
are
are possible
possible with
with all
all the
the letters
letters of
of the
the word
word
PHILIPPINES?
PHILIPPINES?

2.
2. Find
Find the
the number
number of
of different
different ways
ways that
that aa
family
family of
of 66 can
can be
be seated
seated around
around aa circular
circular
table.
table.

3.
3. Suppose
Suppose we
we have
have 66 different
different potted
potted plants
plants
and
and we
we wish
wish to
to arrange
arrange 44 ofof them
them in
in aa row.
row. In
In
how
how many
many ways
ways can
can this
this be
be done?
done?
AlTernative
AlTernative icons
icons