Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am obliged to count the

$$\lim_{n\rightarrow\infty} a_n$$



I know that this type of task, I should use squeeze theorem. I should find two sequences one that is smaller and one that is bigger. So I find $\large b_n=\frac{1}{n^2+1}$, $ b_n \le a_n$, but I have trouble in finding the bigger sequence $c_n \ge a_n$. I will be glad for any help.

share|cite|improve this question
And $\lim b_n=\lim c_n$! You need a better $b_n$. – Martín-Blas Pérez Pinilla Jan 28 '14 at 22:22
up vote 9 down vote accepted

We will use the following: $$\sum_{k=1}^n k=\frac{n(n+1)}{2}.$$ Since $n\geq 1$, we have $$a_{n}=\frac{1}{n^2+1}+\frac{2}{n^2+2}+\frac{3}{n^2+3}+\cdots+\frac{n}{n^2+n}\geq\frac{1}{n^2+n}+\frac{2}{n^2+n}+\frac{3}{n^2+n}+\cdots+\frac{n}{n^2+n}=\frac{n(n+1)}{2(n^2+n)}$$ and $$a_{n}=\frac{1}{n^2+1}+\frac{2}{n^2+2}+\frac{3}{n^2+3}+\cdots+\frac{n}{n^2+n}\leq\frac{1}{n^2}+\frac{2}{n^2}+\frac{3}{n^2}+\cdots+\frac{n}{n^2}=\frac{n(n+1)}{2n^2}.$$ By the squeeze theorem, $\lim_{n\rightarrow\infty} a_n=\frac{1}{2}$.

share|cite|improve this answer

Hint: use, for $1\leq k\leq n$ : $$\frac{k}{n^2+n}\leq \frac{k}{n^2+k}\leq \frac{k}{n^2}.$$ The idea is to remove $k$ from the denominator.

share|cite|improve this answer
@Marcin Majewski And keep in mind what $1+2+\cdots+n$ sums to. – David Mitra Jan 28 '14 at 22:14

Hint : $a_n= n^2(H_{\frac{n}{n+1}}+1$) where $H$ is a harmonic series, which in this case for large $n$ is $\sim -\frac{1}{n+1}+\frac{1}{2(n+1)^2}$.

Can you handle from here?

share|cite|improve this answer

Each term in the expression for $a_n$ is less than or equal to $\displaystyle \frac{n}{n^2+n} = \frac{1}{n+1}$, so I think the upper bound would be $$a_n = \frac{1}{n^2+1} + \frac{2}{n^2+2} + \cdots + \frac{n}{n^2+n} \le \frac{n}{n^2+n} + \frac{n}{n^2+n} + \cdots + \frac{n}{n^2+n} = \frac{n}{n+1} = c_n.$$

Of course, as $n \rightarrow \infty$, $c_n \rightarrow 1$.

share|cite|improve this answer
To whoever downvoted, would you mind explaining WHY you did so? I would like to improve this response if possible. – 2012ssohn Jan 28 '14 at 22:07
Thank you for help. – Marcin Majewski Jan 28 '14 at 22:12
@MarcinMajewski. This is not an answer. There are much better $b_n$ and $c_n$ that are really squeezing. Check the full and correct answer of alans, based on the same idea as mine. – Tom-Tom Jan 28 '14 at 22:22
What about a lower bound? You can't find a limit by squeezing without two bounds both approaching the limit. – Michael Hardy Jan 28 '14 at 22:22

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.