RankLab
Back to Concepts
MathsMediumClass 11

Derangement

Permutation & Combination

9

JEE Qs

8%

Hard

45

min

Master the derivation using the Principle of Inclusion-Exclusion and memorize the direct formula along with the first few values to tackle advanced P&C problems efficiently.

🧮 Key Formulas

D_n = n! * [ (1/0!) - (1/1!) + (1/2!) - (1/3!) + ... + ((-1)^n / n!) ]
D_n = n! * Sum_{k=0 to n} ((-1)^k / k!)
D_n = (n-1) * (D_{n-1} + D_{n-2}) for n >= 2
D_n = n * D_{n-1} + (-1)^n for n >= 1 (with D_0 = 1)

✅ Key Points for JEE

  • 1Derangement refers to an arrangement of 'n' distinct objects such that none of them occupy their original (or designated) positions.
  • 2The formula for D_n is fundamentally derived using the Principle of Inclusion-Exclusion.
  • 3Memorize the values for small 'n': D_0=1, D_1=0, D_2=1, D_3=2, D_4=9, D_5=44, as they frequently appear in problems.
  • 4The recursive relation D_n = (n-1)(D_{n-1} + D_{n-2}) is particularly useful for quickly calculating D_n values or solving problems involving related recurrence relations.

⚠️ Common Mistakes

  • Confusing derangements with permutations where 'some' objects are in their original position, instead of 'none'.
  • Errors in calculation, especially with alternating signs or factorials in the main formula.
  • Not remembering the base cases for the recursive formula (D_0=1, D_1=0), leading to incorrect iterative calculations.

NCERT Chapters

  • Class 11 Maths Ch 7: Permutations and Combinations