In a permutation of distinct integers, an inversion is a pair such that and .
If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of ?
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.
There are ( 2 n ) pairs and each pair is inverted with probability 2 1 . Hence the expected number of inversion is 2 1 ( 2 n ) = 4 n ( n − 1 ) .