How many one-to-one functions there $\phi$ from $\{1,2,3,4,5,\}$ to $\{1,2,3,4,5\}$ such that $\phi(i)\neq i$ for $i=1,2,3,4,5$
Number of permutations of $n$ elements where no number $i$ is in position $i$