Permutations and Combinations - Some Results

1. if n items are arranged in a row, then the number of wasys in which they can be rearranged so that no one of them occupies the place assigned to it (all wrongly placed), is

n![1 - 1/1! + 1/2! - 1/3! +...+(-1)ⁿ(1/n!)]