A Simple Proof that Major Index and Inversions are Equidistributed

Abstract

We present a short proof of MacMahon's classic result that the number of permutations with $k$ inversions equals the number whose major index (sum of positions at which descents occur) is $k$