Abstract
Let , 𝑘 be integers such that 0 < < 𝑘 and (, 𝑘) = 1. If 1 ≤ 𝑖 ≤ 𝑘 – 1, let 𝑟𝑖 be the least positive residue (mod 𝑘) of 𝑖. Let the permutation
For 1 ≤ 𝑖 < 𝑗 ≤ 𝑘 – 1, if 𝑟𝑖 > 𝑟𝑗, this is called an inversion of σ , 𝑘. Let 𝐼(, 𝑘) denote the total number of inversions of σ , 𝑘. In this note, we prove several identities concerning 𝐼(, 𝑘).



















Comments (0)