The number of permutations of the letters of the word HINDUSTAN such that neither the pattern 'HIN' nor 'DUS' nor 'TAN' appears are
Explanation for the correct option:
Find the required number of permutations.
The word ‘HINDUSTAN’ is given.
The total number of permutations of the given word is .
The total number of permutations in which ‘’ appears as a block is .
The total number of permutations in which ‘’ appears as a block is .
The total number of permutations in which ‘’ appears as a block is .
The total number of permutations in which ‘’ and ‘’ appears as a block is . This also includes ‘HINDUSTAN’.
The total number of permutations in which ‘’ and ‘’ appears as a block is . This also includes ‘HINDUSTAN’.
The total number of permutations in which ‘’ and ‘’ appears as a block is . This also includes ‘HINDUSTAN’.
So, the total number of required permutations can be given by .
Therefore, The number of permutations of the letters of the word HINDUSTAN such that neither the pattern '' nor '' nor '' appears are .
Hence, option is the correct answer.