Question:

Six cards and six envelopes are numbered $1$, $2$, $3$, $4$, $5$, $6$ and cards are to be placed in envelopes so that each envelope contains exctly one card and no card is placed in the envelope bearing the same number and moreover the card numbered $1$ is always placed in envelope numbered $2$. Then the number of ways it can be done is

Updated On: Jul 7, 2022
  • $264$
  • $268$
  • $53$
  • $67$
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

Total number of ways to place $6$ cards in wrong envelopes $=6!\left(\frac{1}{0!}-\frac{1}{1!}+\frac{1}{2!}-\frac{1}{3!}+\frac{1}{4!}-\frac{1}{5!}+\frac{1}{6!}\right)$ $=\left(720-720+360-120+30-6+1\right)$ $=265$ If card numbered $(1)$ is placed in $2$, the no. of ways $= 265/5 = 53$
Was this answer helpful?
0
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.