Maths Olympiad Prep

Library / /21 of 56

Algebra Difficulty 5.5 AIME, harder Prove it Singapore

Let nn be a positive integer and a1,a2,,a2na_1, a_2, \dots, a_{2n} be 2n2n distinct integers. Given that the equation
xa1xa2xa2n=(n!)2 |x - a_1| |x - a_2| \dots |x - a_{2n}| = (n!)^2
has an integer solution x=mx = m, find mm in terms of a1,,a2na_1, \dots, a_{2n}.

Solution

We have
ma1ma2ma2n=(n!)2. |m - a_1| |m - a_2| \cdots |m - a_{2n}| = (n!)^2.
First we show that we cannot have distinct ii, jj, kk so that mai=maj=mak|m - a_i| = |m - a_j| = |m - a_k|. If so, then two of (mai)(m - a_i), (maj)(m - a_j), (mak)(m - a_k) must be of the same sign, say (mai)(m - a_i), (maj)(m - a_j). Then ai=aja_i = a_j, a contradiction. Thus the values of ma1|m - a_1|, ma2|m - a_2|, ..., ma2n|m - a_{2n}| are 11, 11, 22, 22, ..., nn, nn. Also if mai=maj|m - a_i| = |m - a_j|, then we must have mai=(maj)m - a_i = -(m - a_j) otherwise ai=aja_i = a_j. Therefore (mai)=0\sum (m - a_i) = 0 and m=a1++a2n2nm = \frac{a_1 + \cdots + a_{2n}}{2n}.

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.