Before You Begin
Question #40300
The Question
Let . A permutation is called \textit{acceptable} if it satisfies at least one of the following two conditions:
(I) for all (II) for all
Find the number of acceptable permutations of .
Options
- A.
621
- B.
576
- C.
411
- D.
309
Check Your Answer
Correct Answer
Step-by-Step Solution
Explanation
How the Examiner Thinks
Bridge
Practice problems that bridge the gap between foundational theory and advanced practical application.
Concepts Behind This Question
Universal Set Relativity|Derangements (Inclusion-Exclusion)|Complementary Counting (Class 11)|Complementary Counting (Class 12)
Why This Question Is Tricky
Common Mistakes
The question tests the Principle of Inclusion-Exclusion (PIE) and the ability to correctly define the universal set when calculating the intersection of complementary events.
The primary trap lies in using De Morgan's laws to find the complement (where means at least one of is fixed, and means at least one of is fixed).
Students often incorrectly calculate this intersection by simply choosing one fixed point from each set and permuting the rest (), leading to the trap answer of .
This flawed approach fails to account for the overlapping sub-cases (e.g., fixing elements 1, 4, and 5 simultaneously), which double-counts permutations in the reduced sample space.
The rigorous method requires applying PIE to find , , and independently.
Quick Facts About This Question
Question Information
| Subject | Mathematics |
| Chapter | Sets - Class 11 |
| Concept | Universal Set Relativity |
| Difficulty | 8 |
| Cognitive Load | 7 |
| Target Solve Time | 160 sec |
| Access | Free |