MODBasic Putnam US

Problem - 4255

Let $\{ a_1, a_2, \cdots, a_{2n+1}\}$ be a set of integers such that after removing any element, the remaining ones can always be equally divided into two groups with equal sum. Show that all these $a_i$, $(1 \le i \le 2n+1)$ are equal.

The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error