Correct Answer
✅ Option a — 81
All Options:
- A81
- B78
- C89
- D64
Ad
Ad
Detailed Solution & Explanation
However, solving this directly for yields:
Since a factorial cannot be negative, this equation is mathematically impossible and indicates a typographical error in the question text.
The standard CA Foundation question of this type is:
Let us solve this corrected version step-by-step:
Multiplying the entire equation by to clear the denominators:
This perfectly matches the value of Option A ().
Hence, **Option A** 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
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 .
If , where denotes the number of permutations, then is:
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