Problem Solving : Arranging Letters of a Word (all letters are not different) 
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
 (Or) 

The product a! × b! × c! × ... should not contain the value of 'x'.
Words formed by 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
 (Or) 

1.  The number of words that can be formed with the lettes of the word "examinations" Solution Show In the given word
In the word to be formed
The number of words that can be formed using all the letters of the word "examinations" taking all the letters at a time

... 141516 ... 