The document presents a problem to find the minimum possible value of a summation involving positive numbers a1, a2, ..., an and a permutation i1, i2, ..., in of 1,2,...,n. It is shown that the minimum occurs when the numbers are ordered from smallest to largest and paired in the summation accordingly. Applying a lemma, the minimum value is proven to be n.