Maths Olympiad Prep

Library / /78 of 158

Number theory Difficulty 5.7 AIME, harder Prove it Estonia

Let nn be a positive integer and a1,,a2na_1, \dots, a_{2n} be real numbers in [12,12]\left[-\frac{1}{2}, \frac{1}{2}\right]. Leaving out any one of the numbers, the sum of the remaining 2n12n-1 numbers is always an integer. Prove that a1==a2na_1 = \dots = a_{2n}.

Solution

Assume that there exist aia_i and aja_j which are not equal. Let S=a1++a2nS = a_1 + \dots + a_{2n}. Since SaiS - a_i and SajS - a_j are integers, their difference (Sai)(Saj)=ajai(S - a_i) - (S - a_j) = a_j - a_i is also an integer. Since ajai0a_j - a_i \neq 0, and they belong to [12,12]\left[-\frac{1}{2}, \frac{1}{2}\right], their difference can be only ±1\pm 1, this happens when aia_i and aja_j are 12\frac{1}{2} and 12-\frac{1}{2} in any order. Let aka_k be any of the given numbers. Since (Sai)(Sak)=akai(S - a_i) - (S - a_k) = a_k - a_i is an integer, aka_k must also be either 12\frac{1}{2} or 12-\frac{1}{2}. Hence all numbers aia_i are either 12\frac{1}{2} or 12-\frac{1}{2}. It follows that the sum of any two numbers aia_i and aja_j is an integer. As we have an even number of them, the sum of all the numbers SS is also an integer. But then Sai=S±12S - a_i = S \pm \frac{1}{2} cannot be an integer, a contradiction. Therefore all numbers aia_i must be equal.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.