Maths Olympiad Prep

Library / /435 of 520

Algebra Difficulty 7.4 National olympiad, round 2 Prove it

Let n n be a positive integer such that n3 n\geq 3. Let a1 a_1, a2 a_2, ..., an a_n and b1 b_1, b2 b_2, ..., bn b_n be 2n 2n positive real numbers satisfying the equations
a1\plusa2\plus...\plusan\equal1,andb12\plusb22\plus...\plusbn2\equal1. a_1 \plus{} a_2 \plus{} ... \plus{} a_n \equal{} 1, \quad \text{and} \quad b_1^2 \plus{} b_2^2 \plus{} ... \plus{} b_n^2 \equal{} 1.
Prove the inequality
a1(b1\plusa2)\plusa2(b2\plusa3)\plus...\plusan\minus1(bn\minus1\plusan)\plusan(bn\plusa1)<1.a_1\left(b_1 \plus{} a_2\right) \plus{} a_2\left(b_2 \plus{} a_3\right) \plus{} ... \plus{} a_{n \minus{} 1}\left(b_{n \minus{} 1} \plus{} a_n\right) \plus{} a_n\left(b_n \plus{} a_1\right) < 1.

Solution

To prove the inequality
a1(b1+a2)+a2(b2+a3)++an1(bn1+an)+an(bn+a1)<1, a_1\left(b_1 + a_2\right) + a_2\left(b_2 + a_3\right) + \cdots + a_{n-1}\left(b_{n-1} + a_n\right) + a_n\left(b_n + a_1\right) < 1,
we will use the given conditions:
a1+a2++an=1andb12+b22++bn2=1. a_1 + a_2 + \cdots + a_n = 1 \quad \text{and} \quad b_1^2 + b_2^2 + \cdots + b_n^2 = 1.

1. Express the sum in terms of two separate sums:
i=1nai(bi+ai+1)=i=1naibi+i=1naiai+1, \sum_{i=1}^n a_i(b_i + a_{i+1}) = \sum_{i=1}^n a_i b_i + \sum_{i=1}^n a_i a_{i+1},
where an+1=a1a_{n+1} = a_1.

2. **Apply the Cauchy-Schwarz inequality to i=1naibi\sum_{i=1}^n a_i b_i:**
(i=1naibi)2(i=1nai2)(i=1nbi2). \left( \sum_{i=1}^n a_i b_i \right)^2 \leq \left( \sum_{i=1}^n a_i^2 \right) \left( \sum_{i=1}^n b_i^2 \right).
Given i=1nbi2=1\sum_{i=1}^n b_i^2 = 1, we have:
(i=1naibi)2i=1nai2. \left( \sum_{i=1}^n a_i b_i \right)^2 \leq \sum_{i=1}^n a_i^2.
Therefore,
i=1naibii=1nai2. \sum_{i=1}^n a_i b_i \leq \sqrt{\sum_{i=1}^n a_i^2}.

3. **Use the fact that i=1nai=1\sum_{i=1}^n a_i = 1 to bound i=1nai2\sum_{i=1}^n a_i^2:**
By the QM-AM inequality (Quadratic Mean - Arithmetic Mean inequality),
i=1nai2ni=1nain=1n. \sqrt{\frac{\sum_{i=1}^n a_i^2}{n}} \geq \frac{\sum_{i=1}^n a_i}{n} = \frac{1}{n}.
Thus,
i=1nai21n. \sum_{i=1}^n a_i^2 \geq \frac{1}{n}.

4. **Consider the sum i=1naiai+1\sum_{i=1}^n a_i a_{i+1}:**
By the AM-GM inequality (Arithmetic Mean - Geometric Mean inequality),
aiai+1ai2+ai+122. a_i a_{i+1} \leq \frac{a_i^2 + a_{i+1}^2}{2}.
Summing over all ii,
i=1naiai+112i=1n(ai2+ai+12)=i=1nai2. \sum_{i=1}^n a_i a_{i+1} \leq \frac{1}{2} \sum_{i=1}^n (a_i^2 + a_{i+1}^2) = \sum_{i=1}^n a_i^2.

5. Combine the results:
i=1naibi+i=1naiai+1i=1nai2+i=1nai2. \sum_{i=1}^n a_i b_i + \sum_{i=1}^n a_i a_{i+1} \leq \sqrt{\sum_{i=1}^n a_i^2} + \sum_{i=1}^n a_i^2.
Since i=1nai21\sum_{i=1}^n a_i^2 \leq 1 and i=1nai21\sqrt{\sum_{i=1}^n a_i^2} \leq 1,
i=1nai2+i=1nai2<1. \sqrt{\sum_{i=1}^n a_i^2} + \sum_{i=1}^n a_i^2 < 1.

Therefore, we have shown that:
a1(b1+a2)+a2(b2+a3)++an1(bn1+an)+an(bn+a1)<1. a_1\left(b_1 + a_2\right) + a_2\left(b_2 + a_3\right) + \cdots + a_{n-1}\left(b_{n-1} + a_n\right) + a_n\left(b_n + a_1\right) < 1.

\blacksquare

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.