Multiple choice

Number of different permutation, each containing all letters of the word "STATESMAN" is

  1. $90720$
  2. $45360$
  3. $22680$

  4. None of these
Reveal answer Fill a bubble to check yourself
B Correct answer
AI explanation

The word STATESMAN contains 9 total letters, with the letters S and A each repeating twice. Using the permutation formula for words with repeating letters, we calculate 9 factorial divided by the product of 2 factorial and 2 factorial. The calculation is 362880 divided by 4, resulting in 90720 total permutations.

Keep practicing — related questions