Let
P
(
n
)
be the probability that a random permutation of
n
distinct elements have no element in their original position.
Find n → ∞ lim P ( n )
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.
Very nice problem! It's amazing how often e appears in probability.
Log in to reply
Indeed! I was doing a maths project recently on the secretary problem and there it was, appearing from simple probabilistic settings. I should post a problem on stopping at the nth best candidate, actually - that'll be soon.
A rather quick approach to the problem would be to use the identity ! n = ⌊ e n ! + 2 1 ⌋ , n ≥ 1 and neglect the floor function and the value 2 1 while evaluating the limit since, in the limit , we have n → ∞ and neglecting those considerations in the identity won't affect the limit much and we can get an approximation quicker this way. So,
n → ∞ lim P ( n ) = n → ∞ lim n ! ! n ≈ n → ∞ lim n ! ⋅ e n ! ≈ e − 1 ≈ 0 . 3 6 7 8
Problem Loading...
Note Loading...
Set Loading...
It is known that there are k = 0 ∑ n k ! n ! ( − 1 ) k derangements of a set of n elements out of a total of n ! permutations.
Hence,
P ( n ) = n ! 1 k = 0 ∑ n k ! n ! ( − 1 ) k = k = 0 ∑ n k ! ( − 1 ) k
Using the fact that k = 0 ∑ ∞ k ! x k = e x ,
n → ∞ lim P ( n ) = k = 0 ∑ ∞ k ! ( − 1 ) k = e − 1 ≈ 0 . 3 6 7 8