Permutation

GROUP 2
What is Permutation?
Permutation
A PERMUTATION of a group of objects is
any arrangement or order of some or all of
these objects.
Permutation
• Is defines as an arrangement of elements in an ordered list. It is used
to determined how many arrangements are possible in the set of
variables considering a sequence and/or a condition.

Formula:
P=n!
Example:
1.) 4!
Solution:
P = n!
P = 4!
=4x3x2x1
P = 24
Example:
2.) 5!3!
Solution:
P = n!
P = 5!3!
= (5 x 4 x 3 x 2 x 1)(3 x 2 x 1)
= (120)(6)
P = 720
Permutation without
repetition
Permutation without repetition is easily identified on a
problem involving sets with no identical elements. This is
the number of possible arrangements when r elements are
chosen from n elements of the set. The formula used for this
permutation is:
P (n,r) =
 Permutation without repetition
Example:
How many permutations are to be made with 3 balls from the 15-ball pool!
Solution:
In this example, we are to pick 3 balls from the 15 balls. Thus, 3 elements are chosen from a
set of 15.
Given:
n = 15
r=3
P (n, r) = = = 15x14x13 = 2,730 arrangements
Permutation with repetition
• Permutation with repetition is identified on a problem
involving sets with identical elements. The repetitions
are solved by dividing the total permutation by the
product of the factorial of the number of identical
elements. The formula used for this permutation is:
P (n,r)rep = ; where x are identical elements
 Permutation with repetition
Example:
How many different permutations can be made from the letters of the word DIFFERENT?
Solution:
In this problem, we need to determine the total number of letters for our n and the number of repetitions per letter x. We have 9 total
letters and two (2) F’s and E’s, one (1) for the remaining letters
Given:
n=9
x1 = F = 2
x2 = E = 2

P (n,r) =

P (n,r) =
= = 9x8x7x6x5x3x2x1 = 90,720
There are 90,720 permutations from the letters of the word DIFFERENT.
CIRCULAR
PERMUTATION
• Circular permutation, also known as cyclic permutation, is a type of permutation that
sets the elements in a circular arrangement, or that has no start point nor an end point.
However, an element f the set shall be designated as a fixed or reference element,
where the fixed element shall be stationary, and the other elements are not. There are
two sub-categories for the circular permutation.
First is that the clockwise and the counterclockwise arrangement of the elements can be
distinguished, then the total number of circular permutations are:
Pc = (n - 1 )!
Second is that if the clockwise nor the counterclockwise arrangement of the elements
are not distinguishable, then the total number of circular permutations are:
Pc =
 CIRCULAR PERMUTATION
EXAMPLE:
HOW MANY WAYS CAN 5 PEOPLE SIT AROUND A TABLE?
SOLUTION:
THE GIVEN PROBLEM IS STRAIGHTFORWARD TO ANSWER. WE WILL BE USING THE
FIRST FORMULA FOR THE CIRCULAR PERMUTATION SINCE THE DIRECTION OF
ARRANGEMENT IS THE DISTINGUISHABLE.
Pc = (n - 1 )!

Pc = (5 - 1 )!
= 4! Pc = 24
= 4x3x2x1
Group 2