Six cards and six envelopes are numbered $1, 2, 3, 4, 5, 6$. Cards are to be placed in envelopes such that each envelope contains exactly one card,no card is placed in the envelope bearing the same number,and the card numbered $1$ is always placed in the envelope numbered $2$. The number of ways this can be done is:

  • A
    $264$
  • B
    $265$
  • C
    $53$
  • D
    $67$

Explore More

Similar Questions

The number of ways of dividing $52$ cards amongst four players equally is

The set $S = \{1, 2, 3, \dots, 12\}$ is to be partitioned into three sets $A, B, C$ of equal size such that $A \cup B \cup C = S$ and $A \cap B = B \cap C = C \cap A = \emptyset$. The number of ways to partition $S$ is:

There are $8$ different coloured balls and $8$ bags having the same colours as that of the balls. If one ball is placed at random in each one of the bags,then the probability that $5$ of the balls are placed in the respective coloured bags,is

There are $4$ distinct colored balls and $4$ boxes of the same colors as the balls. In how many ways can the balls be placed in the boxes such that no ball goes into a box of its own color?

$150$ students took admission. In how many ways can they be divided into three equal sections $A, B,$ and $C$?

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo