Question

Let n be a positive integer. A permutation of [n] is a bijection σ : [n] -> [n]. How many permutations of [n] satisfy the property that σ(1)≠1?

Answer 1

[n] is the set of integers from 1 to n. [n]={1,2,3,...,n}. I think the question is asking how many permutations have 1 not in the first spot in the permutation.