Olympiad Maths Prep

Track / Stage 7 / 282 of 300 #1682 of 2000

Problem 1682

National olympiad second round; IMO P1/P4
Algebra Difficulty 7.8 Prove it

Let r r be a real number such that the sequence (an)n1 (a_{n})_{n\geq 1} of positive real numbers satisfies the equation a1\plusa2\plus\plusam\plus1ram a_{1} \plus{} a_{2} \plus{} \cdots \plus{} a_{m \plus{} 1} \leq r a_{m} for each positive integer m m. Prove that r4 r \geq 4.

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

1. Define the sequence and initial conditions:
Let Sn=i=1nai S_n = \sum_{i=1}^n a_i . Given the condition a1+a2++am+1ram a_1 + a_2 + \cdots + a_{m+1} \leq r a_m , we can rewrite it as Sm+1ram S_{m+1} \leq r a_m .

2. **Establish the increasing nature of Sn S_n :**
Since an>0 a_n > 0 for all n n , the sequence Sn S_n is strictly increasing. This implies Sn+1>Sn S_{n+1} > S_n , and thus r>1 r > 1 .

3. **Define the set K K and its supremum \ell :**
Define K={kR+Sn+1kSn for all nZ+} K = \{ k \in \mathbb{R}_+^* \mid S_{n+1} \geq k S_n \text{ for all } n \in \mathbb{Z}_+^* \} . The set K K is non-empty because 1K 1 \in K (since Sn+1>Sn S_{n+1} > S_n ). Also, K K is bounded above by S2S1 \frac{S_2}{S_1} . Let =supK \ell = \sup K .

4. **Show that K \ell \in K :**
Since \ell is the supremum of K K , for any ϵ>0 \epsilon > 0 , there exists kK k \in K such that ϵ<k \ell - \epsilon < k \leq \ell . This implies Sn+1kSn S_{n+1} \geq k S_n for all n n , and by taking the limit as ϵ0 \epsilon \to 0 , we get Sn+1Sn S_{n+1} \geq \ell S_n .

5. **Derive the inequality involving r r and \ell :**
From the given condition Sm+1ram S_{m+1} \leq r a_m , we have Sn+2r(Sn+1Sn) S_{n+2} \leq r (S_{n+1} - S_n) . Using Sn+1Sn S_{n+1} \geq \ell S_n , we get:
Sn+1Sn+2r(Sn+1Sn) \ell S_{n+1} \leq S_{n+2} \leq r (S_{n+1} - S_n)
This simplifies to:
Sn+1rSn+1rSn \ell S_{n+1} \leq r S_{n+1} - r S_n
Dividing both sides by Sn+1 S_{n+1} and using Sn+1Sn S_{n+1} \geq \ell S_n , we get:
rrSnSn+1rr \ell \leq r - \frac{r S_n}{S_{n+1}} \leq r - \frac{r}{\ell}
Therefore:
rr \ell \leq r - \frac{r}{\ell}
Multiplying both sides by \ell , we obtain:
2rr \ell^2 \leq r \ell - r
Rearranging terms, we get the quadratic inequality:
2r+r0 \ell^2 - r \ell + r \leq 0

6. Analyze the discriminant of the quadratic inequality:
For the quadratic inequality 2r+r0 \ell^2 - r \ell + r \leq 0 to have real solutions, its discriminant must be non-negative:
Δ=r24r0 \Delta = r^2 - 4r \geq 0
Solving for r r , we get:
r24r0    r(r4)0 r^2 - 4r \geq 0 \implies r(r - 4) \geq 0
This implies r4 r \geq 4 or r0 r \leq 0 . Since r>1 r > 1 , we conclude r4 r \geq 4 .

7. **Verify that r=4 r = 4 is achievable:**
Consider the sequence defined by a1=a a_1 = a and an=2n2a a_n = 2^{n-2}a for n2 n \geq 2 . Then:
Sn+1=2Sn    Sn=2n1a S_{n+1} = 2 S_n \implies S_n = 2^{n-1}a
This gives =2 \ell = 2 and r=4 r = 4 , satisfying the given condition.

\blacksquare

The final answer is r4 \boxed{ r \geq 4 }

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