Consider a set of a large number of pairs of envelopes and letters. The
envelope and letter is denoted by
and
respectively and both of them have the number
printed on them.
All the letters have been taken out of the envelopes and now are arranged randomly.
Find the probability that the letter does not go in envelope
Details and Assumptions:
By a large number, I mean the total number of pairs approach infinity.
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.
If ‘n’ particular items need to be arranged or organized in such a manner that none of them acquires its usual or correct place is calculated using the formula: n! ( 1 - (1/1!) + (1/2!) - (1/3!) + ....((-1)^n)*(1/n!)
now the total arrangements of n letters in n alphabets is given by n! so probability =n! [ ( 1 - (1/1!) + (1/2!) - (1/3!) + ....((-1)^n) (1/n!) ] / ( n! ) =( 1 - (1/1!) + (1/2!) - (1/3!) + ....((-1)^n) (1/n!)
now expansion of e^x = 1 + x/( 1! ) + (x^2)/( 2! ) + x^3/( 3! )+.... x^n/( n! ) putting x= -1 we get the required probability so probability = e^( -1 ) = 0.3678