Correct Answer
✅ Option a — 600
All Options:
- A600
- B400
- C1200
- D1400
Ad
Ad
Detailed Solution & Explanation
The given digits are: (total 6 distinct digits). We want to form a 5-digit number without repetition that is **not** divisible by 5.
1. **Total possible 5-digit numbers:** The number of ways to form a 5-digit number from 6 distinct digits is:
2. **5-digit numbers divisible by 5:** A number is divisible by 5 if its unit's digit is 5. Fixing 5 in the unit's place (1 choice), the remaining 4 positions can be filled using the remaining 5 digits in:
3. **5-digit numbers not divisible by 5:** The number of 5-digit numbers not divisible by 5 is:
This matches 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
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