摘要： Inmathematics, therearrangement inequality[1]states thatfor every choice ofreal numbersand everypermutationofx1, ...,xn. If the numbers are different, meaning thatthen the lower bound is attained only for the permutation which reverses the order, i.e. σ(i)=n−i+1 for alli= 1,...,n, and the upper boun 阅读全文