Putnam US InfinitDescend

Problem - 2323
Let $a_1, a_2, \cdots, a_{2n+1}$ be a set of integers such that, if any one of them is removed, the remaining ones can be divided into two sets of $n$ integers with equal sums. Prove $a_1 = a_2 = \cdots = a_{2n+1}$.
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