1. Tardigrade
  2. Question
  3. Mathematics
  4. The number of different permutations, each containing all letters of the word STATESMAN is

Question Error Report

Thank you for reporting, we will resolve it shortly

Back to Question

Q. The number of different permutations, each containing all letters of the word "STATESMAN" is

Permutations and Combinations

Solution:

"STATESMAN"
Total number of letters = 9,
Number of S's = 2, Number of T's = 2, Number of A's = 2
$\therefore $ Required number of permutations
$ = \frac{9!}{(2)! (2)!(2)!} = 45360$