Correct Answer
✅ Option d — 33810
All Options:
- A34650
- B40320
- C840
- D33810
Detailed Solution & Explanation
The word contains 11 letters in total: M = 1, I = 4, S = 4, P = 2.
The total number of permutations is given by:
Next, let us calculate the number of permutations where all four I\'s come together.
If the four I\'s always come together, we treat them as a single entity: (IIII).
The remaining letters are M (1), S (4), and P (2).
Together with the single entity (IIII), we have a total of entities to arrange.
The number of permutations of these 8 entities is:
Finally, the number of permutations where the four I\'s do not come together is the total number of permutations minus the permutations where they are together:
Hence, **Option D** is the correct answer.
About This Chapter: Permutations and Combinations
Paper
Paper 3: Quantitative Aptitude
Weightage
4-6 Marks
Key Topics
Factorials, Permutations, Combinations
This chapter deals with the fundamental principles of counting. It covers factorials, circular permutations, restricted permutations, combinations, and the differences between selecting items versus arranging them.
View Official ICAI SyllabusExam Strategy Tip
The most common mistake is confusing 'P' (Arrangement) with 'C' (Selection). If order matters (like opening a lock), use P. If order doesn't matter (like choosing a team), use C.
More Questions from Permutations and Combinations
The value of in is
A person can go from place 'A' to 'B' by 11 different modes of transport but is allowed to return to 'A' by any mode other than the one earlier. The number of different ways in which the entire journey can be completed is:
If a man travels from place A to B in 10 ways then by how many ways can he come back by another train?
If find 'n'.
Which of the following is a correct statement.
. Find .
Ready to Master Permutations and Combinations?
Practice all 183 questions with instant feedback, earn XP, track your streaks, and ace your CA Foundation exam.
Start Practicing — It's Free