Let G be the set of all permutations of the set {1, 2, …, n}, and let n be an integer 2 2. For each o EG,
let X(a) be the

Let G be the set of all permutations of the set {1, 2, …, n}, and let n be an integer 2 2. For each o EG,
let X(a) be the number of inversions for o, i.e., the number of pairs (i, j) with 1 si
o(j). Calculate the average value of X:

About the author
Piper

1 thought on “Let G be the set of all permutations of the set {1, 2, …, n}, and let n be an integer 2 2. For each o EG,<br /> let X(a) be the”

Leave a Reply to Audrey Cancel reply