Maths Olympiad Prep

Track / Stage 6 / 242 of 400 #1242 of 1964

Problem 1242

National olympiad, first round
Algebra Difficulty 6.4 Prove it

Let a1,a2,,ana_{1}, a_{2}, \ldots, a_{n} be non-negative numbers whose sum is 1, and i=1niai=b\sum_{i=1}^{n} i a_{i}=b and i=1ni2ai=c\sum_{i=1}^{n} i^{2} a_{i}=c. Show that if c=b2c=b^{2}, then bb is an integer.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

I. solution. Based on the conditions,

0=c1b2=(i=1ni2ai)(i=1nai)(i=1niai)2 0=c \cdot 1-b^{2}=\left(\sum_{i=1}^{n} i^{2} a_{i}\right)\left(\sum_{i=1}^{n} a_{i}\right)-\left(\sum_{i=1}^{n} i a_{i}\right)^{2}

from which, after performing the operations, we get

0=i=1n1j=i+1n(i22ij+j2)aiaj 0=\sum_{i=1}^{n-1} \sum_{j=i+1}^{n}\left(i^{2}-2 i j+j^{2}\right) a_{i} a_{j}

On the right side, non-negative terms stand, so their sum can only be zero if each term is individually zero. This means that for every pair 1ijn1 \leqq i \leqq j \leqq n, aiaj=0a_{i} a_{j}=0, which implies that at least n1n-1 of the numbers a1,a2,,ana_{1}, a_{2}, \ldots, a_{n} are zero. The nn-th value, based on i=1nai=1\sum_{i=1}^{n} a_{i}=1, is 1, let this be aka_{k}. Then b=i=1niai=kak=kb=\sum_{i=1}^{n} i a_{i}=k \cdot a_{k}=k, an integer. This proves the statement of the problem.

II. solution. If we place masses of a1,a2,,ana_{1}, a_{2}, \ldots, a_{n} units at the points 1,2,,n1,2, \ldots, n on the number line, the center of mass of the system will be at bb. The extent to which the mass is spread around its center of mass is generally measured by

d=i=1n(ib)2ai d=\sum_{i=1}^{n}(i-b)^{2} a_{i}

This quantity is non-negative by definition and can only be 0 if each term in the above sum is 0. Since the sum of the aia_{i}'s is 1, not all of them can be 0. However, among the factors (ib)2(i-b)^{2}, at most one can be 0, and this only if bb is an integer and ii is equal to it. Therefore, if d=0d=0, then bb is an integer, so it is sufficient to prove that d=0d=0. If we perform the squaring, we get

d=i=1ni2ai2bi=1niai+b2i=1nai=cb2 d=\sum_{i=1}^{n} i^{2} a_{i}-2 b \sum_{i=1}^{n} i a_{i}+b^{2} \sum_{i=1}^{n} a_{i}=c-b^{2}

if therefore c=b2c=b^{2}, then the value of dd is indeed 0.

Remark. Since d0d \geqq 0, it also follows from our solution that cb2c \geqq b^{2} always holds, that is,

i=1ni2ai(i=1niai)2 \sum_{i=1}^{n} i^{2} a_{i} \geqq\left(\sum_{i=1}^{n} i a_{i}\right)^{2}

Similarly, it can generally be shown that if ai0,i=1nai=1a_{i} \geqq 0, \sum_{i=1}^{n} a_{i}=1, and x1,,xnx_{1}, \ldots, x_{n} are arbitrary, then

i=1nxi2ai(i=1nxiai)2 \sum_{i=1}^{n} x_{i}^{2} a_{i} \geqq\left(\sum_{i=1}^{n} x_{i} a_{i}\right)^{2}

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.