Probability : Problem Solving : Arranging Letters of a Word (all letters are not different)

Permutations/Arrangements with repetitions

The number of permutations or arrangements with "n" things taking "r" at a time of which "a" are of one kind, "b" are of another kind, "c" are of a third kind, ...... and "x" are all different such that a + b + c + ... + x = n is given by
nPr
a! × b! × c! × ...
(Or)
n! × (n − 1)! × (n − 2)! × ... "r" times
a! × b! × c! × ...

Permutations/Arrangements taking all the letters of a word (all letters are not different)

The number of words that can be formed using the letters of an "n" letter word taking all at a time ("r" = "n") of which "a" are of one kind, "b" are of another kind, "c" are of a third kind, ...... and "x" are all different such that a + b + c + ... + x = n is given by
nPn
a! × b! × c! × ...
(Or)
n!
a! × b! × c! × ...

» illustration

The no. of words that can be formed with the lettes of the word "examinations"

No. of letters in the word "examinations" = 12 {E, X, A, M, I, N, A, T, I, O, N, S}

No. of :

A's = 2 ⇒ No. of letters of the first kind = 2 ⇒ a = 2

I's = 2 ⇒ No. of letters of the second kind = 2 ⇒ b = 2

N's = 2 ⇒ No. of letters of the third kind = 2 ⇒ c = 2

letters which are all different = 6 {E, X, M, T, O, S} ⇒ x = 6

Therefore,
    No. of words that can be formed using all the letters of the word "examinations" taking all the letters at a time

=
n!
a! × b! × c!
=
12!
2! × 2! × 2!
=
12 × 11 × 10 × 9!
2 × 1 × 2 × 1 × 2 × 1
=
3 × 11 × 5 × 9!
1
= 165 × 9!
Site optimized for IE 7, FF 2 and above. ♣ ♣ Copyright © Krishbhavara - 2009