Daily

Random

Practice set

Baltic Way 1994 · Problem 2

Algebra

Let a1,a2,…,a9a_{1}, a_{2}, \ldots, a_{9} be any non-negative numbers such that a1=a9=0a_{1}=a_{9}=0 and at least one of the numbers is non-zero. Prove that for some i,2≤i≤8i, 2 \leq i \leq 8, the inequality ai−1+ai+1<2aia_{i-1}+a_{i+1}<2 a_{i} holds. Will the statement remain true if we change the number 2 in the last inequality to 1.9?1.9 ?

Change pool

When you’re ready

Review material becomes available with the next Daily.

Review

Topics

Sequences and recurrences · Equations and inequalities

Solutions

Solution

Solution:

Suppose we have the opposite inequality ai−1+ai+1≥2aia_{i-1}+a_{i+1} \geq 2 a_{i} for all i=2,…,8i=2, \ldots, 8. Let ak=max⁡1≤i≤9aia_{k}=\max_{1 \leq i \leq 9} a_{i}. Then we have ak−1=ak+1=aka_{k-1}=a_{k+1}=a_{k}, ak−2=ak−1=aka_{k-2}=a_{k-1}=a_{k}, etc. Finally we get a1=aka_{1}=a_{k}, a contradiction.

Suppose now ai−1+ai+1≥1.9aia_{i-1}+a_{i+1} \geq 1.9 a_{i}, i.e., ai+1≥1.9ai−ai−1a_{i+1} \geq 1.9 a_{i}-a_{i-1} for all i=2,…,8i=2, \ldots, 8, and let ak=max⁡1≤i≤9aia_{k}=\max_{1 \leq i \leq 9} a_{i}. We can multiply all numbers a1,…,a9a_{1}, \ldots, a_{9} by the same positive constant without changing the situation in any way, so we assume ak=1a_{k}=1. Then we have ak−1+ak+1≥1.9a_{k-1}+a_{k+1} \geq 1.9 and hence 0.9≤ak−1,ak+1≤10.9 \leq a_{k-1}, a_{k+1} \leq 1. Moreover, at least one of the numbers ak−1,ak+1a_{k-1}, a_{k+1} must be greater than or equal to 0.950.95 - let us assume ak+1≥0.95a_{k+1} \geq 0.95. Now, we consider two sub-cases:

a. k≥5k \geq 5. Then we have

1≥ak+1≥0.95>01≥ak+2≥1.9ak+1−ak≥1.9⋅0.95−1=0.805>0ak+3≥1.9ak+2−ak+1≥1.9⋅0.805−1=0.5295>0ak+4≥1.9ak+3−ak+2≥1.9⋅0.5295−1=0.00605>0\begin{aligned} 1 &\geq a_{k+1} \geq 0.95 > 0 \\ 1 &\geq a_{k+2} \geq 1.9 a_{k+1}-a_{k} \geq 1.9 \cdot 0.95-1=0.805 > 0 \\ a_{k+3} &\geq 1.9 a_{k+2}-a_{k+1} \geq 1.9 \cdot 0.805-1=0.5295 > 0 \\ a_{k+4} &\geq 1.9 a_{k+3}-a_{k+2} \geq 1.9 \cdot 0.5295-1=0.00605 > 0 \end{aligned}

So in any case we have a9>0a_{9}>0, a contradiction.

b. k≤4k \leq 4. In this case we obtain

1≥ak−1≥0.9>0ak−2≥1.9ak−1−ak≥1.9⋅0.9−1=0.71>0ak−3≥1.9ak−2−ak−1≥1.9⋅0.71−1=0.349>0\begin{aligned} 1 &\geq a_{k-1} \geq 0.9 > 0 \\ a_{k-2} &\geq 1.9 a_{k-1}-a_{k} \geq 1.9 \cdot 0.9-1=0.71 > 0 \\ a_{k-3} &\geq 1.9 a_{k-2}-a_{k-1} \geq 1.9 \cdot 0.71-1=0.349 > 0 \end{aligned}

and hence a1>0a_{1}>0, contrary to the condition of the problem.

Contest context

Results from Baltic Way 1994

9 teams

Mean score
3.1 / 5
Scores of 4 or 5
2 / 9
Estonia
5 / 5

Score distribution

01
10
20
36
40
52
All team scores
TeamScore
St. Petersburg5 / 5
Latvia3 / 5
Poland3 / 5
Sweden3 / 5
Denmark3 / 5
Estonia5 / 5
Finland3 / 5
Lithuania3 / 5
Iceland0 / 5