Given two sequences {Sn} and {Tn} defined as follows: For n∈N∗, Sn=1−21+31−41+⋯+2n−11−2n1, Tn=n+11+n+21+n+31+⋯+2n1. (1) Find S1, S2, T1, T2; (2) Conjecture the relationship between Sn and Tn, 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=1−21=21, S2=1−21+31−41=127 T1=1+11=21, T2=2+11+2+21=127 (2) Conjecture: Sn=Tn (n∈N∗), that is: 1−21+31−41+⋯+2n−11−2n1=n+11+n+21+n+31+⋯+2n1. Now, let's prove it using mathematical induction: (i) When n=1, it has been proven that S1=T1. (ii) Assume when n=k (k⩾1,k∈N∗), Sk=Tk, that is: 1−21+31−41+⋯+2k−11−2k1=k+11+k+21+k+31+⋯+2k1. Then: Sk+1=Sk+2k+11−2(k+1)1=Tk+2k+11−2(k+1)1 =k+11+k+21+k+31+⋯+2k1+2k+11−2(k+1)1 =k+21+k+31+⋯+2k+11+(k+11−2(k+1)1) =(k+1)+11+(k+1)+21+⋯+2k+11+2(k+1)1=Tk+1, From (i) and (ii), it is known that for any n∈N∗, Sn=Tn holds. Therefore, the final answer is Sn=Tn.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.