You are not logged in.
Pages: 1
there are 6 letters and 6 dircted envelopes. then the number of ways in which all leters are put in wrong envelope is
Offline
Hi;
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
thanks bobbym but how can i get this recurrence relation
Offline
Hi juantheron;
This is a standard derangement problem. Well known in combinatorics since Nicholas Bernoulli and Montmort both posed it and solved it. I did not invent this, I just had to look it up. Euler is the one who came up with that recurrence. Whole books have been written about this type problem. The first derivation starts from the principle of inclusion - exclusion. Take a look here to see what I mean:
http://en.wikipedia.org/wiki/Derangement
In combinatorics we solve problems by reducing them to one of several major classes. Birthday problems, urn problems, coupon collector problems, derangement problems etc. Here I just had to look up the type of problem and use the formula provided. Remember, research is part of solving the problem.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Thanks bobbym for nice link
Offline
Hi juantheron;
You are welcome. That generally covers most of it.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Pages: 1