If the letters of the word MATHS are permuted and all possible words so formed are arranged as in a dictionary with serial number, then the serial number of the word THAMS is:
- A
- B
- C
- D
If the letters of the word MATHS are permuted and all possible words so formed are arranged as in a dictionary with serial number, then the serial number of the word THAMS is:
Correct answer:B
Standard Method
Given: We need the rank of the word THAMS among all dictionary arrangements of the letters of MATHS.
Find: The serial number of THAMS.
Arrange the available letters in alphabetical order as A, H, M, S, T. Now count how many valid words come before THAMS.
For the first letter T, the smaller available letters are A, H, M, S. Each such choice gives
words. So the number of words before those starting with T is
Now fix T and look at the second letter H among the remaining letters A, H, M, S. The only smaller available letter is A. For this choice, the remaining letters can be arranged in
ways.
For the third letter A in THAMS, no smaller letter is available among the remaining letters. Similarly, for the fourth letter M and fifth letter S, no additional words occur before THAMS.
Hence, the total number of words before THAMS is
Therefore, its rank is
Therefore, the serial number of THAMS is . The correct option is B.
Factorial Counting Detail
Given: The word is THAMS formed from the letters of MATHS.
Find: Its dictionary rank.
Using alphabetical order,
So THAMS corresponds to the ordered positions T, H, A, M, S.
Count contribution place by place:
Thus,
Adding 1 for the word itself,
Hence the correct option is B.
A common mistake is to stop at . That counts the number of words before THAMS, not the rank itself. Add to get the serial number.
Another mistake is to use the letter order as they appear in MATHS instead of dictionary order. The counting must be based on A, H, M, S, T, not on the original arrangement.
Students may incorrectly count smaller letters before H after fixing T. At that stage only the remaining letters matter, and among A, H, M, S, only A is smaller than H.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.