00:01
So if we let x be the number of fixed elements left in the same position of a random permutation of n elements, so n permutations.
00:30
We can represent this by letting say x.
00:35
If i is, say an index, right, be equal to one when fixed.
00:46
Or zero otherwise.
00:53
Okay.
00:53
And so then x we can represent by the sum from i is equal to 1 to n of x.
01:05
Okay, and so that means we can calculate the expected value.
01:15
Okay, so the expected value of x -s -i then is going to be 1 times the probability that x -of -i is equal to 1 plus 0 times the probability that it is equal to zero.
01:40
Okay, well, obviously this just cancels out.
01:43
And so we're just left with the probability of any of these elements being fixed, right? so what is the probability of any ith point being fixed? well, that's going to be n -minus -1 factorial over n factorial, which is simply 1 over n.
02:13
So this is for the case where i goes from 1 to n.
02:22
Okay, but we also want to observe the expected value of xi squared.
02:28
Right, so we are going to be calculating the variance, so we need that.
02:36
But the expected value of xi squared, right, ends up being 1 squared times the probability that xi is equal to 1 plus 0 squared times the probability...