Olympiad Maths Prep

Track / Stage 7 / 208 of 300 #1608 of 2000

Problem 1608

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

The infinite sequence a0,a1,a2,a3,...a_0, a_1, a_2, a_3,... is defined by a0=2a_0 = 2 and
an=2an1+1an1+2a_n =\frac{2a_{n-1} + 1}{a_{n-1} + 2} , n=1,2,3,...n = 1, 2, 3, ... Prove that 1<an<1+13n1 < a_n < 1 + \frac{1}{3^n} for all n=1,2,3,..n = 1, 2, 3, . .

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 transformation:
Given the sequence an a_n defined by:
a0=2andan=2an1+1an1+2forn1 a_0 = 2 \quad \text{and} \quad a_n = \frac{2a_{n-1} + 1}{a_{n-1} + 2} \quad \text{for} \quad n \geq 1
we introduce a new sequence cn c_n such that:
cn=1an1 c_n = \frac{1}{a_n - 1}
This transformation is valid since an>1 a_n > 1 for all n n .

2. Transform the recurrence relation:
Using the definition of cn c_n , we can express an a_n in terms of cn c_n :
an=1+1cn a_n = 1 + \frac{1}{c_n}
Substitute an a_n into the recurrence relation:
an=2an1+1an1+2 a_n = \frac{2a_{n-1} + 1}{a_{n-1} + 2}
becomes:
1+1cn=2(1+1cn1)+11+1cn1+2 1 + \frac{1}{c_n} = \frac{2 \left(1 + \frac{1}{c_{n-1}}\right) + 1}{1 + \frac{1}{c_{n-1}} + 2}
Simplify the right-hand side:
1+1cn=2+2cn1+11+1cn1+2=3+2cn13+1cn1 1 + \frac{1}{c_n} = \frac{2 + \frac{2}{c_{n-1}} + 1}{1 + \frac{1}{c_{n-1}} + 2} = \frac{3 + \frac{2}{c_{n-1}}}{3 + \frac{1}{c_{n-1}}}
Multiply numerator and denominator by cn1 c_{n-1} :
1+1cn=3cn1+23cn1+1 1 + \frac{1}{c_n} = \frac{3c_{n-1} + 2}{3c_{n-1} + 1}
Subtract 1 from both sides:
1cn=3cn1+23cn1+11=3cn1+2(3cn1+1)3cn1+1=13cn1+1 \frac{1}{c_n} = \frac{3c_{n-1} + 2}{3c_{n-1} + 1} - 1 = \frac{3c_{n-1} + 2 - (3c_{n-1} + 1)}{3c_{n-1} + 1} = \frac{1}{3c_{n-1} + 1}
Therefore:
cn=3cn1+1 c_n = 3c_{n-1} + 1

3. **Solve the recurrence relation for cn c_n :**
The recurrence relation cn=3cn1+1 c_n = 3c_{n-1} + 1 with c0=1 c_0 = 1 is a linear non-homogeneous recurrence relation. To solve it, we first solve the homogeneous part:
cn(h)=A3n c_n^{(h)} = A \cdot 3^n
For the particular solution, we assume cn(p)=B c_n^{(p)} = B . Substituting into the recurrence relation:
B=3B+1    B=12 B = 3B + 1 \implies B = -\frac{1}{2}
Therefore, the general solution is:
cn=A3n12 c_n = A \cdot 3^n - \frac{1}{2}
Using the initial condition c0=1 c_0 = 1 :
1=A3012    A=32 1 = A \cdot 3^0 - \frac{1}{2} \implies A = \frac{3}{2}
Thus:
cn=323n12=3n+112 c_n = \frac{3}{2} \cdot 3^n - \frac{1}{2} = \frac{3^{n+1} - 1}{2}

4. **Express an a_n in terms of cn c_n :**
Recall that:
an=1+1cn a_n = 1 + \frac{1}{c_n}
Substituting cn c_n :
an=1+23n+11 a_n = 1 + \frac{2}{3^{n+1} - 1}

5. **Prove the inequality 1<an<1+13n 1 < a_n < 1 + \frac{1}{3^n} :
-
Lower bound:**
an=1+23n+11>1 a_n = 1 + \frac{2}{3^{n+1} - 1} > 1
since 23n+11>0 \frac{2}{3^{n+1} - 1} > 0 .

- Upper bound:
an=1+23n+11<1+13n a_n = 1 + \frac{2}{3^{n+1} - 1} < 1 + \frac{1}{3^n}
We need to show:
23n+11<13n \frac{2}{3^{n+1} - 1} < \frac{1}{3^n}
Cross-multiplying:
23n<3n+11 2 \cdot 3^n < 3^{n+1} - 1
Simplifying:
23n<33n1    23n<33n1    2<313n 2 \cdot 3^n < 3 \cdot 3^n - 1 \implies 2 \cdot 3^n < 3 \cdot 3^n - 1 \implies 2 < 3 - \frac{1}{3^n}
which is true for all n1 n \geq 1 .

\blacksquare

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