Let S={1,2,3.....6} i is said to be a fixed point of a permutation p or S if p(i)=i,where i belongs to S.Let be the number of permutations of S which have k fixed points. Find ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
For a permutation σ ∈ S n , let f ( σ ) be the number of fixed points of σ . The sum is σ ∈ S n ∑ n f ( σ ) = n 1 σ ∈ S n ∑ f ( σ ) Any particular element of { 1 , 2 , … , n } is fixed by ( n − 1 ) ! permutations, so the total number of fixed points of all the permutations is ( n − 1 ) ! n = n ! . (So the average number of fixed points of a permutation in S n is exactly equal to 1.)
So the sum becomes n 1 ⋅ n ! = ( n − 1 ) ! . For n = 5 this is 1 2 0 .