Sign up ×
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.

The exact series I must show converges absolutely is:


for $s > 1$, $r\in \mathbb{N}$ and where $d(n)=\#\text{ of divisors of } n$. I've been able to show that $d(n)$, $d(n)^r$ are multiplicative and so my series is Dirichlet. As such, I've broken this into Euler sums and thus transformed the series to

$$\prod_{P}\left(1 + \frac{d(p)^r}{p^s} + \frac{d(p^2)^r}{p^{2s}} + \cdots\right) = \prod_{P}\sum_{s=0}^{\infty}{\frac{(s+1)^r}{p^s}}$$

I'm not sure how to proceed from here. Any help is appreciated, thanks!

share|cite|improve this question
First, your infinite series in Euler product is wrong. It should be $\sum_n \frac{(n+1)^r}{p^{ns}}$. – user27126 Nov 14 '12 at 1:07
One way to proceed is to take log and bound the log of each term in the Euler product. Try to show that each series $\sum_n \frac{(n+1)^r}{p^{ns}}$ is really a sum of finitely many terms (depending on $r$) of constants times $\frac{1}{(log p)^k(1-p^{-s})^k}$, where $k$ goes up to $r$. This allows you to bound log of the series, by sum of log of $\frac{1}{(log p)^k(1-p^{-s})^k}$, and it's easy to see that the latter sum converges for $s > 1$. – user27126 Nov 14 '12 at 1:09

1 Answer 1

up vote 1 down vote accepted

It is known (see for instance Apostol's book Introduction to analytic number theory) that for all $\epsilon>0$ $$ d(n)=o(n^\epsilon). $$ Given $s>1$ choose $\epsilon=\dfrac{s-1}{2\,r}>0$. Then $$ \sum_{n=1}^\infty\frac{d(n)^r}{n^s}\le C\sum_{n=1}^\infty\frac{n^{r\epsilon}}{n^s}=C\sum_{n=1}^\infty\frac{1}{n^{s-r\epsilon}}=C\sum_{n=1}^\infty\frac{1}{n^{(s+1)/2}}<\infty, $$ where $C$ is a constant depending on $s$ and $r$.

share|cite|improve this answer
I was going to include it in the question, but decided against it because it would just add clutter. But the relation $d(n)=O(n^ϵ)$ is what we ultimately need to deduce – user45793 Nov 12 '12 at 18:55

Your Answer


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