Problem

Source: India Postals 2015 Set 1

Tags: number theory, inequalities



Let $n \in \mathbb{N}$ be such that $gcd(n, 6) = 1$. Let $a_1 < a_2 < \cdots < a_n$ and $b_1 < b_2 < \cdots < b_n$ be two collection of positive integers such that $a_j + a_k + a_l = b_j + b_k + b_l$ for all integers $1 \le j < k < l \le n$. Prove that $a_j = b_j$ for all $1 \le j \le n$.