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 total number of ways of dividing $52$ cards amongst $4$ players,such that $3$ players have $17$ cards each and the fourth player has just $1$ card,is:

Eight persons are to be transported from city $A$ to city $B$ in three cars of different makes. If each car can accommodate at most three persons,then the number of ways,in which they can be transported,is $...........$.

If there are $4$ letters and $4$ envelopes,in how many ways can all the letters be placed in the wrong envelopes?

Difficult
View Solution

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

There are $n$ different objects $1, 2, 3, \dots, n$ distributed at random in $n$ places marked $1, 2, 3, \dots, n$. The probability that at least three of the objects occupy places corresponding to their number is

Difficult
View Solution

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