Problem

Source: Regional Olympiad - Federation of Bosnia and Herzegovina 2017

Tags: arithmetic mean, Sets, number theory, combinatorics



Let $S$ be a set of $n$ distinct real numbers, and $A_S$ set of arithemtic means of two distinct numbers from $S$. For given $n \geq 2$ find minimal number of elements in $A_S$