Distinguishable

Permutation

Circular
Permutation
Give all the possible
three-letter arrangements in the
following words:

1.SUM
2.ADD
 As shown in the diagram there are 6 arrangements.
There are 2-ADD, 2-DAD, and 2- DDA. We know that
the permutations of 3 letters of the word ADD are 3!, we
must take into consideration that we cannot distinguish
between the two D’s in any of the permutation but the
two D’s can be permuted in 2! ways and do not produce
a different result. Hence, the number of distinguishable
permutations P is given by
3
 Permutations with Repetition
(Distinguishable Permutation)

The number of permutations of n things where a things are

alike, b things are alike, and c things are alike, and so forth,
is:
Answer the following:

1. Find the number of distinguishable permutations of the letters in the word BASKETBALL.

Solution:

BASKETBALL - 10 letters (2B’s, 2A’s, 2L’s)

n=10
a=2
b=2
c=2

= 453,600
Answer the following:

2. A frontliner at the Pasig City General Hospital has 3 blue PPEs, 2 white PPEs, and 1 green PPE. In how
many ways can he arrange all his PPE’s in his locker?

Solution:

n=6
a=3
b=2

= 60 ways
In how many ways can 3 people A, B, and C
be seated in a row?

Solution:
n=3, r=3 P=n!
P=3!=6
Arrangements:
ABC
ACB
BAC
BCA
CAB
CBA
In how many ways can 3 people A, B, and C
be seated around a circular table?
If we arrange 3 persons around a circular table, as shown in the diagram below, notice that the
arrangement does not change even if each person moves his position by one place. In this particular
arrangement, C is always on the right side of A, and B is always on the left side of A. Hence, it represents
one permutation. There is no starting point in the arrangement of things in a circular pattern. So, when
each person moves his position by one place clockwise or counter clockwise, the positions are not changed.
Circular Permutation Formula
P = (n - 1)!

Observe the arrangement of different beads in a bracelet,

keys on the key rings, and the like. The clockwise and the
counter-clockwise orders are not distinguishable then the total
number of circular permutations of n elements taken all
together is
But if bracelets, key rings, and the like have
a lock, then the permutation becomes linear
and can be denoted as
So, the important points about circular arrangements are
as follows:
1. If the clockwise and the counter-clockwise orders CAN be distinguished,
then the total number of circular
permutations of n elements taken all together is

(n – 1)!

2. If the clockwise and the counter-clockwise orders CANNOT be

distinguished, then the total number of circular permutations of n elements
taken all together is (without lock),
and (with lock).
Examples:
1. In how many ways can 6 people be seated at a round table?

Solution:
P = (n – 1)!
= ( 6 – 1)!
= 5!
P = 120 ways

2. In how many ways can 5 different beads be arranged if:

A. a bracelet has no lock?

B. a bracelet has a lock?

Solution:
A. P=
B. Since the bracelet has a lock, we can determine where
to start.
P=