- #1

SpiffyEh

- 194

- 0

## Homework Statement

An inversion of a permutation is a pair of elements that are out of order.

(a) Show that a permutation of n items has at most n(n−1)/2 inversions. Which

permutation(s) have exactly n(n − 1)/2 inversions?

(b) Let P be a permutation and Pr be the reversal of this permutation. Show

that P and Pr have a total of exactly n(n − 1)/2 inversions.

(c) Use the previous result to argue that the

## Homework Equations

## The Attempt at a Solution

I honestly have no idea where to even start with this problem. I don't completely understand it. can someone please guide me through it?