Maths Olympiad Prep

Library / /29 of 36

Algebra Difficulty 6.3 National Olympiad Prove it Saudi Arabia

Let a1a2a50a_1 \le a_2 \le \dots \le a_{50} be real numbers such that
(i) a1+a2++a50=0,a_1 + a_2 + \dots + a_{50} = 0,
(ii) a1+a2++a50=624.|a_1| + |a_2| + \dots + |a_{50}| = 624.
Find the minimum value for S=a50a1S = a_{50} - a_1 and maximum value of T=a1a2a50T = a_1a_2 \dots a_{50}.

Solution

Suppose that kk is the maximum index such that ak0a_k \le 0 then ak0<ak+1a_k \le 0 < a_{k+1}. Thus ak+1++a50=(a1+a2++ak)a_{k+1} + \dots + a_{50} = -(a_1 + a_2 + \dots + a_k) and then
a1+a2++ak=a1+a2++ak=ak+1+ak+2++a50=6242=312. |a_1| + |a_2| + \dots + |a_k| = |a_1 + a_2 + \dots + a_k| = a_{k+1} + a_{k+2} + \dots + a_{50} = \frac{624}{2} = 312.
We have
312=a1+a2++akka1    a1312k, -312 = a_1 + a_2 + \dots + a_k \ge k \cdot a_1 \implies a_1 \le \frac{-312}{k},
312=ak+1+ak+2++a50(50k)a50    a5031250k. 312 = a_{k+1} + a_{k+2} + \dots + a_{50} \le (50-k) \cdot a_{50} \implies a_{50} \ge \frac{312}{50-k}.
Hence,
a50a131250k+312k=312(1k+150k)3124k+50k=62425. a_{50} - a_1 \ge \frac{312}{50-k} + \frac{312}{k} = 312 \left( \frac{1}{k} + \frac{1}{50-k} \right) \ge 312 \cdot \frac{4}{k+50-k} = \frac{624}{25}.
The minimum value of S=62425S = \frac{624}{25}, the equality case when
a1=a2==a25=31225 and a26=a27==a50=31225. a_1 = a_2 = \dots = a_{25} = -\frac{312}{25} \text{ and } a_{26} = a_{27} = \dots = a_{50} = \frac{312}{25}.
We will continue with TT. If there is some ak=0a_k = 0 then T=0T = 0. Now suppose that all of given numbers are non-zero and there are kk negative numbers among a1,a2,,a50a_1, a_2, \dots, a_{50}. If kk is odd then T<0T < 0. Thus to find the maximum value of TT, we consider kk is even. Put h=50kh = 50 - k. By AM-GM inequality, we have
T(a1+a2++akk)k(ak+1+ak+2++a50h)h=(312k)k(312h)h=312h+kkkhh=31250kkhh. \begin{aligned} T &\le \left( \frac{a_1 + a_2 + \dots + a_k}{k} \right)^k \cdot \left( \frac{a_{k+1} + a_{k+2} + \dots + a_{50}}{h} \right)^h \\ &= \left( \frac{312}{k} \right)^k \left( \frac{312}{h} \right)^h = \frac{312^{h+k}}{k^k h^h} = \frac{312^{50}}{k^k h^h}. \end{aligned}
We need to prove that
kkhh24242626. k^k \cdot h^h \ge 24^{24} \cdot 26^{26}.
WLOG, khk \le h then kh2k \le h - 2 since k,hk, h are even. Suppose that kh4k \le h - 4 then we can use local modification to prove that
kkhh>(k+1)k+1(h1)h1    h(1+1h1)h1>(k+1)(1+1k)k() k^k \cdot h^h > (k+1)^{k+1} \cdot (h-1)^{h-1} \iff h \cdot \left(1 + \frac{1}{h-1}\right)^{h-1} > (k+1) \cdot \left(1 + \frac{1}{k}\right)^k \quad (*)
Consider the function f(x)=(x+1)(1+1x)xf(x) = (x+1) \cdot (1+\frac{1}{x})^x with x>1x > 1 and
g(x)=lnf(x)=ln(x+1)+xln(1+1x). g(x) = \ln f(x) = \ln(x+1) + x \cdot \ln\left(1+\frac{1}{x}\right).
We have
g(x)=11+x+ln(1+1x)11+x=ln(1+1x)0. g'(x) = \frac{1}{1+x} + \ln\left(1 + \frac{1}{x}\right) - \frac{1}{1+x} = \ln\left(1 + \frac{1}{x}\right) \geq 0.
Thus g(x)g(x) increasing and then (*) is proved. Therefore, the maximum value of TT is 1324122613^{24} \cdot 12^{26}. The equality case when
a1=a2==a24=13, a25=a26==a50=12. a_1 = a_2 = \dots = a_{24} = -13,\ a_{25} = a_{26} = \dots = a_{50} = 12.

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.