The number of ways in which $4$ letters can be put into $4$ addressed envelopes such that no letter goes into the envelope meant for it is:

$n$ distinct items $1, 2, 3, \dots, n$ are arranged in $n$ distinct positions $1, 2, 3, \dots, n$. What is the probability that at least three items are in their correct positions?

If $5$ letters are to be placed in $5$ addressed envelopes,then the probability that at least one letter is placed in the wrongly addressed envelope 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

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$ person writes letters to $6$ friends and addresses the corresponding envelopes. In how many ways can the letters be placed in the envelopes so that at least two of them are in the wrong envelopes?
Notation : $D_n = n! \left( \sum_{i=0}^n \frac{(-1)^i}{i!} \right)$