Professional Documents
Culture Documents
Distinguishable permutations – refers to the permutations of a set of objects where some of them
are alike. The number of distinguishable permutations of n objects when p are alike, q are alike, r are
𝑛!
alike, and so on, is given by P = 𝑝!𝑞!𝑟!
Example: Find the number of permutations of the letters of the word EVEN.
n=4, word EVEN-(E = 2, V = 1, N = 1)
𝑛! 4! 4! (4)(3)(2)(1)
P = 𝑝!𝑞!𝑟! = 2!1!1! = 2! = (2)(1)
= (4)(3) = 12 distinguishable permutations
Activity: Solve the following problem and write your answer below.
1. Find the number of permutations of the letters of the word STATISTICS.
2. Find the number of distinguishable permutations of the digits of the number 348 838.
3. How many distinguishable permutations are possible with all the letters of the word
ELLIPSES?
This space is
for the QR
Code