If there are $5$ letters written to $5$ different people and $5$ envelopes addressed to them,then the number of ways in which these letters can be arranged so that no letter goes into its corresponding envelope 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?

Let the set $S = \{2, 4, 8, 16, \ldots, 512\}$ be partitioned into $3$ sets $A, B, C$ with an equal number of elements such that $A \cup B \cup C = S$ and $A \cap B = B \cap C = A \cap C = \phi$. The number of such possible partitions of $S$ is equal to:

In an examination,$5$ students have been allotted their seats as per their roll numbers. The number of ways,in which none of the students sits on the allotted seat,is $..........$.

There are four balls of different colours and four boxes of colours same as those of the balls. The number of ways in which the balls,one in each box,could be placed such that a ball does not go to the box of its own colour is

Consider a square matrix of order $5$ such that $a_{ij} = 0$ for all $i + j = 6$,where $a_{ij} \in \{0, 1\}$ for all $i, j$. In each row as well as in each column,there is only one non-zero element. Then,the number of such matrices is: