Start Learning Free

Before You Begin

Question #40586

Difficulty: 8/10 | 🟢 Free

The Question

Let S={1,2,3,4,5}S = \{1, 2, 3, 4, 5\}. Find the number of permutations π\pi of SS such that π(i)≠i\pi(i) \neq i for all 1≤i≤51 \le i \le 5, and additionally π(1)≠2\pi(1) \neq 2, π(2)≠3\pi(2) \neq 3, and π(3)≠1\pi(3) \neq 1.

Options

  • A.

    19

  • B.

    20

  • C.

    22

  • D.

    25

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

Derangements (Inclusion-Exclusion)|Cardinality Inclusion-Exclusion|Set Complement Boundaries

Why This Question Is Tricky

Common Mistakes

This question tests the 'Set Complement Boundary' trap within a restricted universe.

Students commonly assume that fixing one element in a derangement reduces the problem to a standard derangement of size n−1n-1 (i.e., incorrectly assuming ∣D∩C1∣=D4=9|D \cap C_1| = D_4 = 9).

However, because the fixed element π(1)=2\pi(1)=2 is not mapped to its own index, the element 11 is freed from any positional restriction in the remaining mapping.

This shifts the boundary of the forbidden set, requiring a custom inclusion-exclusion calculation for the sub-universe (4!−3×3!+3×2!−1!=11≠94! - 3 \times 3! + 3 \times 2! - 1! = 11 \neq 9).

Failing to recalculate these shifted boundaries leads directly to the trap answer of 22.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterPermutations and Combinations - Class 11
ConceptDerangements (Inclusion-Exclusion)
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree