Correct Answer
✅ Option b — 2520
All Options:
- A5040
- B2520
- C120
- D40320
Ad
Ad
Detailed Solution & Explanation
If all 10 letters were distinct (like in the standard word "LOGARITHMS"), the number of 4-letter words would be .
Since 'A' is repeated twice, the textbook answer key attempts to adjust for this repetition by dividing the total permutations by :
This matches Option B.
Let us also show the mathematically rigorous derivation of this problem:
The distinct letters are (9 distinct, with 'A' having frequency 2, and others frequency 1).
- **Case 1: All 4 letters are distinct.** We select 4 distinct letters from 9: .
- **Case 2: 2 letters are 'A' and the other 2 are distinct.** We select 2 other distinct letters from 8: .
- **Total rigorous ways:** .
Since 3360 is not in the options, Option B (2520) is the intended textbook answer based on the simplified division logic.
Hence, **Option B** 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.
Related Comparison Tables
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 251 questions with instant feedback, earn XP, track your streaks, and ace your CA Foundation exam.
Start Practicing — It's Free