MathematicsDerangement PrincipleJEE AdvancedEasy
Visualized Solution (English)
Visualizing the Setup
- Given: 4 balls and 4 boxes of matching colors.
- Constraint: No ball should go into the box of its own color.
- This is a classic problem of Derangements.
Defining Derangement
- A Derangement of n objects is a permutation with no fixed points.
- Symbolized as Dn, it counts the ways to arrange n items so that none are in their original position.
- For this problem, we need to find D4.
The Derangement Formula
- The general formula for Dn is:
- Dn=n!(0!1−1!1+2!1−3!1+⋯+n!(−1)n)
- This formula uses the Inclusion-Exclusion Principle.
Substitution for n=4
- Substitute n=4 into the formula:
- D4=4!(0!1−1!1+2!1−3!1+4!1)
Simplifying the Series
- Simplify the factorial terms:
- D4=4!(1−1+21−61+241)
- Notice that 1−1=0, so these terms cancel out.
Calculating 4!
- Calculate 4!:
- 4!=4×3×2×1=24
- The expression becomes: 24(21−61+241)
Final Atomic Compute
- Distribute 24 into the brackets:
- D4=224−624+2424
- D4=12−4+1=9
Conclusion and Takeaway
- Final Answer: The number of ways is 9.
- Key Takeaway: For n=4, D4=9.
- Pro-tip: Memorizing small derangement values like D3=2, D4=9, and D5=44 can save time in JEE.
00:00 / 00:00
Conceptually Similar Problems
MathematicsCombinations and SelectionJEE Advanced 1981Moderate
MathematicsCombinations and SelectionJEE Advanced 2012Easy
MathematicsCombinations and SelectionJEE Advanced 1986Easy
MathematicsCombinations and SelectionJEE Main 2004Easy
MathematicsCombinations and SelectionJEE Main 2012Easy
MathematicsCombinations and SelectionJEE Main 2010Easy
MathematicsCombinations and SelectionJEE Main 2011Easy
MathematicsClassical Definition of ProbabilityJEE Main 2010Easy
MathematicsCombinations and SelectionJEE Advanced 1978Easy
MathematicsClassical Definition of ProbabilityJEE Advanced 1978Easy