Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

Question Show that the series $\sum _{n=1}^{\infty }\dfrac {nz^{n-1}} {z^{n}-\left( 1+\dfrac {1} {n }\right) ^{n}}$ converges absolutely if $\left| z\right| < 1$.

Answer For, when $\left| z\right| < 1$,$\left| z^{n}-\left( 1+\dfrac {1} {n}\right) ^{n}\right| \geq \left( 1+\dfrac {1} {n}\right) ^{n}-\left| z^{n}\right| \geq 1+1+\dfrac {n-1} {2n}+\ldots -1>1 $, so the moduli of the terms of the series are less than the corresponding terms of the series $\sum _{n=1}^{\infty }n\left| z^{n-1}\right| $; but this latter series is absolutely convergent, and so the given series converges absolutely.

I am having a trouble following the reason how the first 2 inequalities in the solution hold. I am sure this must be a trivial question, but i am dumb. Any help would be much appreciated.

share|cite|improve this question
up vote 1 down vote accepted

In the first inequality we just used $|a-b|\geq |a|-|b|$ where $a=\left(1+\frac 1n\right)^n$ and $b=z^n$, then we use the fact that $-|z|^n\geq -1$ to get, thanks to the formula which gives the expansion of $(a+b)^n$ $$\left|z^n-\left(1+\frac 1n\right)^n\right|\geq \left(1+\frac 1n\right)^n-1=1+n\frac 1n+\sum_{k=2}^n\binom nk\frac 1{n^k}-1=1+\sum_{k=2}^n\binom nk\frac 1{n^k}>1.$$

share|cite|improve this answer
Thanks that was very helpful i suspected similar reasons but was n't sure. – Comic Book Guy Mar 1 '12 at 19:05

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.