+91 9600 121 800

Plans

Dashboard

Daily & Speed

Quant

Verbal

DILR

Compete

Free Stuff

calendarBack
Quant

/

Modern Maths

/

Permutations & Combinations

Permutations And Combinations

MODULES

bookmarked
Basics of Permutations
bookmarked
Basics of Combinations
bookmarked
Letters Technique
bookmarked
Using Blanks
bookmarked
Blanks with Repetition
bookmarked
Slotting Technique
bookmarked
Conditional Permutations
bookmarked
Special Types
bookmarked
Circular Permutations
bookmarked
Derangement
bookmarked
Binomial Expansion
bookmarked
Forming Groups
bookmarked
Identical Elements
bookmarked
Identical Groups
bookmarked
Selection in Geometry
bookmarked
Past Questions

CONCEPTS & CHEATSHEET

Concept Revision Video

SPEED CONCEPTS

Permutations & Combinations 1
-/10
Permutations & Combinations 2
-/10
Permutations & Combinations 3
-/10
Permutations & Combinations 4
-/10
Permutations & Combinations 5
-/10
Permutations & Combinations 6
-/10

PRACTICE

Permutations & Combinations : Level 1
Permutations & Combinations : Level 2
Permutations & Combinations : Level 3
ALL MODULES

CAT 2025 Lesson : Permutations & Combinations - Derangement

bookmarked

5. Derangement

Derangements of
r\bm{r}r objects is when each of these objects are misplaced or wrongly assigned.

Number of Derangements
=== D(r)\bm{(r)}(r) = r!×(1−11!+12!−13!+...)r! \times \left( 1 - \dfrac{1}{1!} + \dfrac{1}{2!} - \dfrac{1}{3!} + ... \right)r!×(1−1!1​+2!1​−3!1​+...)

In cases where there is a total of
n\bm{n}n objects, and r\bm{r}r of them are misplaced or wrongly assigned, we first select the rrr elements in nCr^{n}C_{r}nCr​ ways and then derange them.

Number of such derangements
=== nCr×D(r)=^{n}C_{r} \times D(r) =nCr​×D(r)= nCr×r!×(1−11!+12!−13!+...)^{n}C_{r} \times r! \times \left( 1 - \dfrac{1}{1!} + \dfrac{1}{2!} - \dfrac{1}{3!} + ... \right)nCr​×r!×(1−1!1​+2!1​−3!1​+...)

It's not too hard to derive the derangements. However, we recommend you to memorise the following.

D(1)=0(1) = 0(1)=0 D(2)=1(2) = 1(2)=1 D(3)=2(3) = 2(3)=2 D(4)=9(4) = 9(4)=9 D(5)=44(5) = 44(5)=44

Furthermore, derangements can be derived as follows.
When
nnn is odd, D(n)=((n) = ((n)=(D(n−1)×n)−1(n - 1) \times n) - 1(n−1)×n)−1
When
nnn is even, D(n)=((n) = ((n)=(D(n−1)×n)+1(n - 1) \times n) + 1(n−1)×n)+1

Using this we can derive D
(6)=44×6+1=265(6) = 44 \times 6 + 1 = 265(6)=44×6+1=265; D(7)=265×7−1=1854(7) = 265 \times 7 - 1 = 1854(7)=265×7−1=1854 and so on.

Example 37

What is the number of ways in which 666 letters can be put into 666 envelopes, such that exactly 222 of the letters get into the correct envelopes?

Solution

From 666 letters, 444 need to be selected and put into incorrect envelopes, i.e. deranged.

Number of ways
=== 6C4×^{6}C_{4} \times6C4​× D(4)=15×9=135(4) = 15 \times 9 = 135(4)=15×9=135

Answer:
135135135


Loading...Loading Video....