# Number of permutations without constants [duplicate]

Given a vector of n elements, how can I calculate the number of "true" permutations, i.e. permutations that do not leave any element at the same position? Expressed differently, how do I find the number of possible $n\times n$ permutation matrices that only have zeros on their diagonal?

-