Olympiad Maths Prep

Track / Stage 4 / 18 of 340 #278 of 2000

Problem 278

AMC 12 late, AIME early
Algebra Difficulty 4.5 Prove it

Given two sequences {Sn}\{S_n\} and {Tn}\{T_n\} defined as follows:
For nNn\in\mathbb{N}^*, Sn=112+1314++12n112nS_n=1- \frac{1}{2}+ \frac{1}{3}- \frac{1}{4}+\cdots + \frac{1}{2n-1}- \frac{1}{2n}, Tn=1n+1+1n+2+1n+3++12nT_n= \frac{1}{n+1}+ \frac{1}{n+2}+ \frac{1}{n+3}+\cdots + \frac{1}{2n}.
(1) Find S1S_1, S2S_2, T1T_1, T2T_2;
(2) Conjecture the relationship between SnS_n and TnT_n, and prove it using mathematical induction.

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

Solution:
(1) S1=112=12S_1=1- \frac{1}{2}= \frac{1}{2}, S2=112+1314=712S_2=1- \frac{1}{2}+ \frac{1}{3}- \frac{1}{4}= \frac{7}{12}
T1=11+1=12T_1= \frac{1}{1+1}= \frac{1}{2}, T2=12+1+12+2=712T_2= \frac{1}{2+1}+ \frac{1}{2+2}= \frac{7}{12}
(2) Conjecture: Sn=TnS_n=T_n (nNn\in\mathbb{N}^*), that is:
112+1314++12n112n=1n+1+1n+2+1n+3++12n1- \frac{1}{2}+ \frac{1}{3}- \frac{1}{4}+\cdots + \frac{1}{2n-1}- \frac{1}{2n}= \frac{1}{n+1}+ \frac{1}{n+2}+ \frac{1}{n+3}+\cdots + \frac{1}{2n}.
Now, let's prove it using mathematical induction:
(i) When n=1n=1, it has been proven that S1=T1S_1=T_1.
(ii) Assume when n=kn=k (k1,kNk\geqslant 1, k\in\mathbb{N}^*), Sk=TkS_k=T_k,
that is: 112+1314++12k112k=1k+1+1k+2+1k+3++12k1- \frac{1}{2}+ \frac{1}{3}- \frac{1}{4}+\cdots + \frac{1}{2k-1}- \frac{1}{2k}= \frac{1}{k+1}+ \frac{1}{k+2}+ \frac{1}{k+3}+\cdots + \frac{1}{2k}.
Then: Sk+1=Sk+12k+112(k+1)=Tk+12k+112(k+1)S_{k+1}=S_k+ \frac{1}{2k+1}- \frac{1}{2(k+1)}=T_k+ \frac{1}{2k+1}- \frac{1}{2(k+1)}
=1k+1+1k+2+1k+3++12k+12k+112(k+1)= \frac{1}{k+1}+ \frac{1}{k+2}+ \frac{1}{k+3}+\cdots + \frac{1}{2k}+ \frac{1}{2k+1}- \frac{1}{2(k+1)}
=1k+2+1k+3++12k+1+(1k+112(k+1))= \frac{1}{k+2}+ \frac{1}{k+3}+\cdots + \frac{1}{2k+1}+ (\frac{1}{k+1}- \frac{1}{2(k+1)})
=1(k+1)+1+1(k+1)+2++12k+1+12(k+1)=Tk+1= \frac{1}{(k+1)+1}+ \frac{1}{(k+1)+2}+\cdots + \frac{1}{2k+1}+ \frac{1}{2(k+1)}=T_{k+1},
From (i) and (ii), it is known that for any nNn\in\mathbb{N}^*, Sn=TnS_n=T_n holds.
Therefore, the final answer is Sn=Tn\boxed{S_n=T_n}.

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