I encountered the following double sum which requires an evaluation.

Is there a closed form for this? $$\sum_{n=0}^{\infty}\frac{\sum_{k=0}^n\binom{n}k^{-1}}{(n+1)(n+2)}.$$ Incidentally, it seems that the following gives (empirically) the same value. Does it? $$\sum_{n=1}^{\infty}\frac1{2^{n-1}(n+1)}\sum_{k=1}^n\frac{\binom{n}{2k-1}}{2k-1}.$$

  • 2
    looks like $\pi^2/6$. Represent the inverse binomial as a Beta integral and transform the sum under integrand as a geometric progression. – Fedor Petrov Jun 3 at 16:18
  • 4
    $\sum\binom{n}k^{-1}<3$, so the series converges. – T. Amdeberhan Jun 3 at 16:20
  • 6
    1st time I tried Wolfram Alpha. Maybe last time, ha ha. – Mark L. Stone Jun 3 at 16:34
  • 2
    @MarkL.Stone: Strangely, WA is very sensitive to syntax: in correct Mathematica syntax I get the opposite: "By the comparison test, the series converges." – Alex M. Jun 3 at 17:24
  • 2
    Numerical calculations do not confirm your suggestion, producing for the second sum from 1 to 2000 the value 1.12068617279184 (the code on demand). – user64494 Jun 3 at 19:12
up vote 28 down vote accepted

Consider the integral $$I=\int_0^1\int_0^1\frac{zdzdt}{(1-zt)(1-z(1-t))}=\sum_{k,j\geqslant 0} \int_0^1\int_0^1 z^{k+j+1}t^k(1-t)^jdzdt=\\ \sum_{k,j\geqslant 0} \frac1{k+j+2}\cdot \frac{k!j!}{(k+j+1)!},$$ that is your sum (denote $n=k+j$). For evaluating the integral, we first integrate by $t$, get $-2\log(1-z)/(2-z)$. Now denote $1-z=x$ and integrate $2\log x/(1+x)=2\log x(1-x+x^2-x^3+\dots)$ using $\int_0^1 -\log x\cdot x^m dx=\frac1{(m+1)^2}$. We get $2(1-1/4+1/9-1/16+\dots)=\pi^2/6$.

As for your second sum, it has indeed the same value which may be obtained similarly. We consider the integral $$ \int_0^1\int_0^1 \frac1x\left(\frac1{1-y\frac{1+x}2}-\frac1{1-y\frac{1-x}2}\right)dxdy=\\ \sum_n \int_0^1y^n dy\cdot 2^{1-n}\int_0^1\frac{(1+x)^n-(1-x)^n}{2x}dx, $$ that is your sum (expand $(1+x)^n-(1-x)^n=2\sum \binom{n}{2k-1}x^{2k-1}$ and integrate).

If we integrate first in $x$, we get $-2\log(1-y)/(2-y)$, the same thing as in the first sum.

  • Good job, Fedor. Hope one can also solve (answer) the second part of the problem which I posted after your reply. – T. Amdeberhan Jun 4 at 17:49
  • @T.Amdeberhan added. I wonder why computations show another answer. – Fedor Petrov Jun 5 at 8:42
  • It might be that the 2nd series is slowly converging. – T. Amdeberhan Jun 5 at 12:57
  • It converges as $\sum 1/n^2$, 1000 terms should give the accuracy about $1/1000$. – Fedor Petrov Jun 6 at 12:23

Your Answer

 
discard

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

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