Question

There are 3 letters and 3 addressed envelopes corresponding to them. The number of ways in which the letters be placed in the envelopes so that no letter is in the right envelope is

• A. 2
• B. 3
• C. 4
• D. 5

Answer 1

Answer: (A)

2

There are $3$ letters and $3$ addressed envelopes

Now we will have $2$ ways by which we can put first letter in wrong envelopes and for second letter we will have only one envelope to put that in wrong way

$\therefore$Total number of ways $=2$