n students are arranged in a line.
If a teacher randomly reallocates their seats, what is the probability P n that there's only one student in the original position?
Submit your answer as the limit n → ∞ lim P n .
Try this problem first.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Remove the one student from n − 1 students whose seat is fixed.
Now, we need to find the probability that none of the rest n − 1 students are seated in their original positions. This is called Dearrangement.
Derrangement of p people seated in a row such that none of them is alloted their correct positions is P p = 1 − 1 ! 1 + 2 ! 1 − 3 ! 1 + . . . . + ( − 1 ) p p ! 1
As p = n − 1 → ∞ − 1 → ∞ ,
P ∞ = e − 1
As we know Taylor Series of e x = 1 + x + 2 ! x 2 + 3 ! x 3 + 4 ! x 4 + . . . . . . . . .
Hence, the required Probabalility P n = e − 1 = e 1 = 2 . 7 1 4 2 8 . . 1 = 0 . 3 6 7 . . .
Problem Loading...
Note Loading...
Set Loading...
Required cases = (number of ways of selecting correctly seated student) × (number of ways of de-arranging the others)
The probability is,
n ! n C 1 ⋅ ( n − 1 ) ! ( 2 ! 1 − 3 ! 1 + 4 ! 1 − 5 ! 1 + . . . ( − 1 ) n ( n − 1 ) ! 1 )
= ( 2 ! 1 − 3 ! 1 + 4 ! 1 . . .
Using e x = 1 + x + 2 ! x 2 + 3 ! x 3 . . . , we can prove that the above probability(for n tending to ∞) is equal to e − 1 .