Scribd
Upload
14 views

Permutation: Counting Techniques

1. Permutations refer to arrangements of objects in a definite order. The number of permutations of n distinct objects taken r at a time without repetition is calculated as nPr = n!/(n-r)!. 2. Circular permutations refer to arrangements of objects arranged in a circle, with no beginning or end. The number of circular permutations of n objects is (n-1)!. 3. Distinguishable permutations account for cases where some objects are identical. The number of distinguishable permutations of n objects where p objects are alike, r objects are alike, and so on is calculated by dividing n! by the factorial of the number of alike objects.

Uploaded by

juvss
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
14 views

Permutation: Counting Techniques

1. Permutations refer to arrangements of objects in a definite order. The number of permutations of n distinct objects taken r at a time without repetition is calculated as nPr = n!/(n-r)!. 2. Circular permutations refer to arrangements of objects arranged in a circle, with no beginning or end. The number of circular permutations of n objects is (n-1)!. 3. Distinguishable permutations account for cases where some objects are identical. The number of distinguishable permutations of n objects where p objects are alike, r objects are alike, and so on is calculated by dividing n! by the factorial of the number of alike objects.

Uploaded by

juvss
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

P E R M U TAT I O N

C O U N T I N G T E C H N I Q U E S
P E R M U TAT I O N
• Permutation
  maybe defined as an arrangement of a number of objects in a definite or specific
order.
For example:
The permutation of c, d, and e are: cde, ced, dec, ecd, and edc.
• Using the multiplication principle it can be generalized that given n different things, they can be
arranged . This product of whole numbers from 1 to n is called n factorial.
••  Definition 1: The product of the first positive integers is called n factorial and is

denoted by n!
•.

n How obtained n!
1 1 1
2 2x1 2
3 3x2x1 6
4 4x3x2x1 24
5 5x4x3x2x1 120
••  Definition2: Any arrangement of r objects taken from a set of n
distinct objects is called permutation of n object taken r at a time.
• The number of permutations of n different objects taken r at a time,
when none of the objects is to be repeated in any arrangement is;
𝒏!
𝒏𝑷𝒓 =
  (𝒏 −𝒓 )!
• Example 1:
In how many ways can the first prize, the second price and the third prize be
awarded to three entries in essay contest?

• Example 2:
In how many ways can the first prize, the second price and the third prize be
awarded to ten entries in essay contest?
𝒏!
𝒏𝑷𝒓 =
  (𝒏 −𝒓 )!
••  Example 3:

How many nonsense words of 3 letters can be formed from the letters a, b, c, d,
e, f, and g using each letter only once.
The number of nonsense words are:
C I R C U L A R P E R M U TAT I O N
•  

To find the number of different ways n objects may be arranged in a circle, first
designate a point of origin where we place one of the objects. From this point of
origin, all the other objects can be arranged in different ways to form a circle.
Thus, the number of permutation of n distinct of objects arranged in a circle is:
EXAMPLE
••  In how many ways can 8 persons be seated at a round table with 8 chairs?

Solution:
Given n = 8

Therefore,
= 7!
= 5040 ways
D I S T I N G U I S H A B L E P E R M U TAT I O N
•  

The number of distinguishable permutations, P, of n objects where p objects are


alike, r objects are alike, and so on is;
EXAMPLE
•  Find the number of permutations of the letters of the word STATISTICS.
Solution:
There are 10 letters of the word. Assuming that the letters are distinct, there are Permutation.
However we have to take into consideration that the 3 S’s are alike, the 3 T’s are alike, and 2 I’s
are also alike. The permutation of the 3 S’s is P(3, 3) = 3!. The permutations of the 3 T’s is P(3, 3) =
3!. The permutation of the 2 T’s is P(2, 2) = 2!
So we must divide 10! By 3!, 3!, and 2! In order to eliminate the duplicates. Thus,

You might also like