I need to prove that the sequence an=1+122+132+⋯+1n2 converges. I do not have to find the limit. I have tried to prove it by proving that the sequence is monotone and bounded, but I am having some trouble:
Monotonic:
The sequence seems to be monotone and increasing. This can be proved by induction: Claim that an≤an+1
a1=1≤1+122=a2
Need to show that an+1≤an+2
an+1=1+122+132+⋯+1n2+1(n+1)2≤1+122+132+⋯+1n2+1(n+1)2+1(n+2)2=an+2
Thus the sequence is monotone and increasing.
Boundedness:
Since the sequence is increasing it is bounded below by a1=1.
Upper bound is where I am having trouble. All the examples I have dealt with in class have to do with decreasing functions, but I don't know what my thinking process should be to find an upper bound.
Can anyone enlighten me as to how I should approach this, and can anyone confirm my work thus far? Also, although I prove this using monotonicity and boundedness, could I have approached this by showing the sequence was a Cauchy sequence?
Thanks so much in advance!
Answer
Your work looks good so far. Here is a hint:
1n2≤1n(n−1)=1n−1−1n
To elaborate, apply the hint to get:
122+132+142+⋯+1n2≤(11−12)+(12−13)+(13−14)+⋯+(1n−1−1n)
Notice that we had to omit the term 1 because the inequality in the hint is only applicable when n>1. No problem; we will add it later.
Also notice that all terms on the right-hand side cancel out except for the first and last one. Thus:
122+132+142+⋯+1n2≤1−1n
Add 1 to both sides to get:
an≤2−1n≤2
It follows that an is bounded from above and hence convergent.
It is worth noting that canceling behavior we saw here is called telescoping. Check out the wikipedia article for more examples.
No comments:
Post a Comment