Interchanging

In how many ways 7 letters can be placed in 7 envelopes such that no letter is placed in its corresponding envelope?


The answer is 1854.

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.

1 solution

Alpana Singhal
Aug 28, 2014

it is a dearngemnt problem n! [ 1 - 1/1! + 1/2! - 1/3! ............ 1/n!]

for placing n letters in n wrong envelopes

Another formula to quickly evaluate the value of ! n !n is:

! n = n ! e !n=\left \lfloor \frac{n!}{e} \right \rceil

where, f ( x ) = ! x f(x)=!x is the subfactorial function used to find the number of possible derangements of n n items, f ( x ) = x f(x)=\left \lfloor x \right \rceil is the nearest integer function , f ( x ) = x ! f(x)=x! is the factorial function and e e is the Euler's number .

Prasun Biswas - 6 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...