Solveeit Logo

Question

Question: Let $N_{10} = \{1, 2, 3, ..., 10\}$. Consider a permutation $p$ of $N_{10}$. A point $k$ is fixed by...

Let N10={1,2,3,...,10}N_{10} = \{1, 2, 3, ..., 10\}. Consider a permutation pp of N10N_{10}. A point kk is fixed by pp, if p(k)=kp(k) = k. A permutation with no fixed point is called derangement. Considering all permutations, what is the number of fixed points:

A

10

B

100

C

50

D

1

Answer

1

Explanation

Solution

The question asks about the number of fixed points considering all permutations of N10={1,2,...,10}N_{10} = \{1, 2, ..., 10\}. A fixed point of a permutation pp is an element kN10k \in N_{10} such that p(k)=kp(k) = k. The phrasing "the number of fixed points" is ambiguous.

The average number of fixed points per permutation is the total number of fixed points divided by the number of permutations: 10!10!=1\frac{10!}{10!} = 1. The average number of fixed points in a random permutation of nn elements is always 1.