Before You Begin
Question #41085
The Question
Let . A permutation of the elements of is chosen uniformly at random. Let be the set of all integers satisfying the inequality . What is the probability that for all , the elements and are NOT adjacent in the chosen permutation?
Options
- A.
- B.
- C.
- D.
Check Your Answer
Correct Answer
Step-by-Step Solution
Explanation
How the Examiner Thinks
Specialist
Targeted practice for niche, high-difficulty concepts that frequently appear in JEE Advanced exams.
Concepts Behind This Question
De Morgan’s Laws in Probability|String Method (Adjacency)|Modulus Inequality Logic
Why This Question Is Tricky
Common Mistakes
The question tests the application of De Morgan's Laws and the String Method under constrained conditions.
The primary trap lies in the modulus inequality , which yields the set .
Students must identify the forbidden adjacent pairs: .
The critical error occurs when students blindly apply the standard Inclusion-Exclusion formula assuming these pairs are disjoint (yielding the trap answer 134/315).
In reality, the pairs overlap at elements 6 and 7, requiring the formation of 3-element strings (e.g., 3-6-9) and significantly altering the intersection cardinalities in the Inclusion-Exclusion expansion.
Quick Facts About This Question
Question Information
| Subject | Mathematics |
| Chapter | Probability - Class 11 |
| Concept | De Morgan’s Laws in Probability |
| Difficulty | 8 |
| Cognitive Load | 7 |
| Target Solve Time | 160 sec |
| Access | Free |