Maths Olympiad Prep

Library / /425 of 520

Algebra Difficulty 4.5 AIME Prove it

Given the sequence an{a_n} where a1=2a_1=2, an+1=21ana_{n+1}=2-\frac{1}{a_n}, and the sequence bn{b_n} where bn=1an1b_n=\frac{1}{a_n-1}, where nNn\in\mathbb{N}^*.

1. Prove that the sequence bn{b_n} is an arithmetic sequence.
2. If SnS_n denotes the sum of the first nn terms of the sequence 13bn{\frac{1}{3}b_n}, find 1S1+1S2+...+1Sn{\frac{1}{S_1}+\frac{1}{S_2}+...+\frac{1}{S_n}}.
3. If TnT_n denotes the sum of the first nn terms of the sequence (13)nbn{(\frac{1}{3})^n\cdot b_n}, prove that Tn<34T_n<\frac{3}{4}.

Solution

1. bn+1=1an+11=111an=anan1b_{n+1}=\frac{1}{a_{n+1}-1}=\frac{1}{1-\frac{1}{a_n}}=\frac{a_n}{a_n-1}. Since bn=1an1b_n=\frac{1}{a_n-1}, we have bn+1bn=anan11an1=1b_{n+1}-b_n=\frac{a_n}{a_n-1}-\frac{1}{a_n-1}=1 for all nNn\in\mathbb{N}^*. Therefore, bn{b_n} is an arithmetic sequence with first term b1=1a11=1b_1=\frac{1}{a_1-1}=1 and common difference 11.

2. From part 1, we know that bn=nb_n=n. Hence, 13bn=13n\frac{1}{3}b_n=\frac{1}{3}n, and Sn=13(1+2+...+n)=n(n+1)6S_n=\frac{1}{3}(1+2+...+n)=\frac{n(n+1)}{6}. Thus, 1Sn=6n(n+1)=6(1n1n+1)\frac{1}{S_n}=\frac{6}{n(n+1)}=6(\frac{1}{n}-\frac{1}{n+1}). Consequently, 1S1+1S2+...+1Sn=6(112+1213+...+1n1n+1)=6(11n+1)=6nn+1\frac{1}{S_1}+\frac{1}{S_2}+...+\frac{1}{S_n}=6(1-\frac{1}{2}+\frac{1}{2}-\frac{1}{3}+...+\frac{1}{n}-\frac{1}{n+1})=6(1-\frac{1}{n+1})=\boxed{\frac{6n}{n+1}}.

3. We will prove by induction that Tn<34T_n<\frac{3}{4} for all nNn\in\mathbb{N}^*. From part 1, we have (13)nbn=n(13)n(\frac{1}{3})^n\cdot b_n=n\cdot(\frac{1}{3})^n. Hence, Tn=113+2(13)2+...+n(13)nT_n=1\cdot\frac{1}{3}+2\cdot(\frac{1}{3})^2+...+n\cdot(\frac{1}{3})^n. Multiplying both sides by 13\frac{1}{3}, we get 13Tn=1(13)2+2(13)3+...+(n1)(13)n+n(13)n+1\frac{1}{3}T_n=1\cdot(\frac{1}{3})^2+2\cdot(\frac{1}{3})^3+...+(n-1)\cdot(\frac{1}{3})^n+n\cdot(\frac{1}{3})^{n+1}. Subtracting this from the previous equation, we obtain 23Tn=13+(13)2+(13)3+...+(13)nn(13)n+1=12[1(13)n]n(13)n+1\frac{2}{3}T_n=\frac{1}{3}+(\frac{1}{3})^2+(\frac{1}{3})^3+...+(\frac{1}{3})^n-n\cdot(\frac{1}{3})^{n+1}=\frac{1}{2}[1-(\frac{1}{3})^n]-n\cdot(\frac{1}{3})^{n+1}. Therefore, Tn=3414(13)n1n2(13)n<34T_n=\frac{3}{4}-\frac{1}{4}(\frac{1}{3})^{n-1}-\frac{n}{2}\cdot(\frac{1}{3})^n<\boxed{\frac{3}{4}}.

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.