MathDB
Rearrangement inequality

Source: ISI(BS) 2010 #1

May 16, 2012
inequalitiesrearrangement inequalityinequalities proposed

Problem Statement

Let a1,a2,,ana_1,a_2,\cdots, a_n and b1,b2,,bnb_1,b_2,\cdots, b_n be two permutations of the numbers 1,2,,n1,2,\cdots, n. Show that i=1ni(n+1i)i=1naibii=1ni2\sum_{i=1}^n i(n+1-i) \le \sum_{i=1}^n a_ib_i \le \sum_{i=1}^n i^2