Maths Olympiad Prep

Library / /91 of 100

Algebra Difficulty 6.3 National olympiad Prove it China

Suppose sequence {an}\{a_n\} satisfies a1=2t3a_1 = 2t - 3 (tRt \in \mathbb{R} and t±1t \neq \pm 1),
an+1=(2tn+13)an+2(t1)tn1an+2tn1(nN). a_{n+1} = \frac{(2t^{n+1} - 3)a_n + 2(t-1)t^n - 1}{a_n + 2t^n - 1} \quad (n \in \mathbb{N}^*).

(1)
Find the formula of general term about {an}\{a_n\}.

(2)
If t>0t > 0, find out which is larger between an+1a_{n+1} and ana_n.

Solution

(1) The given expression can be rewritten as
an+1=2(tn+11)(an+1)an+2tn11. a_{n+1} = \frac{2(t^{n+1} - 1)(a_n + 1)}{a_n + 2t^n - 1} - 1.
Then
an+1+1tn+11=2(an+1)an+2tn1=2(an+1)tn1an+1tn1+2. \frac{a_{n+1} + 1}{t^{n+1} - 1} = \frac{2(a_n + 1)}{a_n + 2t^n - 1} = \frac{\frac{2(a_n + 1)}{t^n - 1}}{\frac{a_n + 1}{t^n - 1} + 2}.
Let an+1tn1=bn\frac{a_n + 1}{t^n - 1} = b_n. Then bn+1=2bnbn+2b_{n+1} = \frac{2b_n}{b_n + 2}, with b1=a1+1t1=2t2t1=2b_1 = \frac{a_1 + 1}{t - 1} = \frac{2t - 2}{t - 1} = 2.

Furthermore, 1bn+1=1bn+12\frac{1}{b_{n+1}} = \frac{1}{b_n} + \frac{1}{2}, 1b1=12\frac{1}{b_1} = \frac{1}{2}. Then
1bn=1b1+(n1)12=n2. \frac{1}{b_n} = \frac{1}{b_1} + (n-1) \cdot \frac{1}{2} = \frac{n}{2}.
Therefore, an+1tn1=2n\frac{a_n + 1}{t^n - 1} = \frac{2}{n}, which means an=2(tn1)n1a_n = \frac{2(t^n - 1)}{n} - 1.

(2) We have
an+1an=2(tn+11)n+12(tn1)n=2(t1)n(n+1)[n(1+t++tn1+tn)(n+1)(1+t++tn1)]=2(t1)n(n+1)[ntn(1+t++tn1)]=2(t1)n(n+1)[(tn1)+(tnt)++(tntn1)]=2(t1)2n(n+1)[(tn1+tn2++1)+t(tn2+tn3++1)++tn1]. \begin{aligned} a_{n+1} - a_n &= \frac{2(t^{n+1} - 1)}{n+1} - \frac{2(t^n - 1)}{n} \\ &= \frac{2(t-1)}{n(n+1)} \left[ n(1+t+\cdots+t^{n-1}+t^n) - (n+1)(1+t+\cdots+t^{n-1}) \right] \\ &= \frac{2(t-1)}{n(n+1)} \left[ nt^n - (1+t+\cdots+t^{n-1}) \right] \\ &= \frac{2(t-1)}{n(n+1)} \left[ (t^n-1) + (t^n-t) + \cdots + (t^n-t^{n-1}) \right] \\ &= \frac{2(t-1)^2}{n(n+1)} \left[ (t^{n-1}+t^{n-2}+\cdots+1) + t(t^{n-2}+t^{n-3}+\cdots+1) + \cdots + t^{n-1} \right]. \end{aligned}
It is obvious that an+1an>0a_{n+1} - a_n > 0 for t>0t > 0 (t1t \neq 1). Therefore, an+1>ana_{n+1} > a_n.

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: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.