Question
Question: A person writes a letter to six friends and addresses the corresponding envelopes. In how many ways ...
A person writes a letter to six friends and addresses the corresponding envelopes. In how many ways can the letters be placed in the envelopes so that all of them are in the wrong envelope?
Solution
In this question, we have to find a number of ways in which six letters can be in the envelope so that all of them are in the wrong envelope. For this, we will make use of derangement which is permutation of elements in a way that no element appears in its original position. Number of derangement for n item is given by Dn=n!k=0∑nk!(−1)k.
Complete step by step answer:
Here we are given six letters and we have to place them in an envelope such that all letters are placed in the wrong envelope. For finding such a number of ways, let us use the formula for the number of derangements. Derangement is defined as a permutational arrangement such that no elements are placed at its original position. Here, no letter should be in the original envelope. So we need to find a number of derangements.
Number of derangement for n items is given by Dn=n!k=0∑nk!(−1)k.
Here, n = 6 so we get, D6=6!k=0∑6k!(−1)k.
Let us expand the summation, we get:
D6=6![0!(−1)0+1!(−1)1+2!(−1)2+3!(−1)3+4!(−1)4+5!(−1)5+6!(−1)6]
We know that, even power absorbs the negative sign but odd power does not, so we get,
D6=6![0!1−1!1+2!1−3!1+4!1−5!1+6!1]
Now let us calculate all the factorials. We know that 0! = 1.
Now, 1! = 1.
2! can be written as 2×1 which is equal to 2.
3! can be written as 3×2×1 which is equal to 6.
4! can be written as 4×3×2×1 which is equal to 24.
5! can be written as 5×4×3×2×1 which is equal to 120.
6! can be written as 6×5×4×3×2×1 which is equal to 720.
Putting in the values we get,
D6=720[1−1+21−61+241−1201+7201]
Cancelling 1 with 1 we get,
D6=720[21−61+241−1201+7201]
Taking LCM of 720 we get,