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

The series is: $\sum_{n=1}^\infty {(\frac{n}{n+2})}^{n^2}$. I'm relatively certain it converges, but I'm not sure how to prove this. It was suggested that I try and use the comparison test, but I'm not sure which series I could use to compare it with.

share|cite|improve this question
WA says that it uses the ratio test.… – Sabyasachi Mar 15 '14 at 20:18
up vote 3 down vote accepted

$(1+\frac{2}{n})^n\ge 1+\frac{2}{n}.n=3$

It follows that, $(\frac{n}{2+n})^{n^2}\le \frac{1}{3^n}$

share|cite|improve this answer
I'm a little confused how you derived the first line : $(1+\frac{2}{n})^n\ge 1+\frac{2}{n}.n$ – userzzz23 Mar 15 '14 at 20:25
@Kyle its the binomial theorem $(1+x)^n \ge 1+ {n\choose 1}x + {n \choose 2}x^2 + .. \ge 1+nx$ – r9m Mar 15 '14 at 20:27
Even easier, @Kyle: it is Bernoulli's's_inequality – DonAntonio Mar 15 '14 at 20:28


$$a_n:=\left(\frac n{n+2}\right)^{n^2}=\frac1{\left(1+\frac2n\right)^{n^2}}\implies$$


share|cite|improve this answer
Apparently someone didn't like my answer....oh, well. – DonAntonio Mar 15 '14 at 20:23
Personally I like it.+1 – user63181 Mar 15 '14 at 20:36

Using Taylor series we prove easily the convergence of the series by comparison:

$$\left(\frac{n}{n+2}\right)^{n^2}=\left(1+\frac2n\right)^{-n^2}=\exp\left(-n^2\log\left(1+\frac2n\right)\right)\sim_\infty e^{-2n}=_\infty o\left(\frac1{n^2}\right)$$

share|cite|improve this answer

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.