MathDB
Combo seems Easy but I cannot Get

Source:

July 28, 2016
combinatorics

Problem Statement

The numbers 1,2,...,2n1,2n1,2,...,2n-1,2n are divided into two disjoint sets, a1<a2<...<ana_1 < a_2 < ... < a_n and b1>b2>...>bnb_1 > b_2 > ... > b_n. Prove that a1b1+a2b2+...+anbn=n2.|a_1 - b_1| + |a_2 - b_2| + ... + |a_n - b_n| = n^2.