Question:

There are 4 letters and 4 directed envelopes. The number of ways in which all the letters can be put in wrong envelope is

Updated On: Jan 12, 2024
  • 9
  • 4
  • 5
  • 12
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

Let us first consider 2 letters and 2 envelopes, then there is only one way to place both the letters in wrong envelope. Next, we consider 3 letters and 3 directed envelopes. The number of ways of putting all letters in wrong envelopes = Total number of possible arrangements - Number of ways in which all letters are in correct envelopes - Number of ways in which 1 letter in correct envelope $= 3 \,! - 1 - ^3C_1 ? 1 = 2$ [ $\therefore$ The case of two letters in correct envelope and one in wrong envelope is not possible] Further, we consider 4 letters and 4 directed envelopes. The number of ways of putting all letters in wrong envelopes = Total number of possible arrangements - number of ways in which all letters are in correct envelope - Number of ways in which 1 letter is in correct envelopes (3 in wrong envelope) - Number of ways in which 2 letters are in correct envelope (2 in wrong envelope) $= 4\, ! - 1 - ^4C_1 ? 1 = 9$ Such problems are called problems of deragement. Hence, using the formula of deragement. The required number of ways of placing all letters in wrong envelope $4!\left[1-\frac{1}{1!}+\frac{1}{2!}-\frac{1}{2!}+\frac{1}{4!}\right]=\frac{4!}{2!}-\frac{4!}{3!}+\frac{4!}{4!}=12-4+1=9$
Was this answer helpful?
1
0

Concepts Used:

Permutations and Combinations

Permutation:

Permutation is the method or the act of arranging members of a set into an order or a sequence. 

  • In the process of rearranging the numbers, subsets of sets are created to determine all possible arrangement sequences of a single data point. 
  • A permutation is used in many events of daily life. It is used for a list of data where the data order matters.

Combination:

Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.

  • Combination refers to the combination of about n things taken k at a time without any repetition.
  • The combination is used for a group of data where the order of data does not matter.