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

I ran across an interesting series. I looked at it and must admit, I do not even know where to begin. I tried playing around with it, but to no avail.

Here it is. Perhaps it isn't doable.

$$\displaystyle \frac{1}{\ln(2)}+\frac{1}{\ln(2)\ln(3)}+\frac{1}{\ln(2)\ln(3)\ln(4)}+\cdots $$

I ran this through Maple. It does appear to converge.

It gave me $4.934269949\dots$

Can this even be evaluated in some clever manner?

share|cite|improve this question
Looks unlikely to have a closed form to me, with the multiple logarithms and all. – J. M. Dec 3 '11 at 12:13
It's easy to see that it indeed converges (by the Ratio Test, say). – David Mitra Dec 3 '11 at 12:21

I think the key is "first to generalize". Clearly the infinite product of logs of consecutive arguments is divergent, but as in the problem of summing-of-like powers, which leads to the bernoulli-numbers, it can be meaningful to provisorically assume a constant expression for this. Say we assume a function $\small P(a) = \ln(1+a) \cdot \ln(1+a+1) \cdot \ln(1+a+2) \cdot \ldots $, then we could write the above sum as $$\small S(2) = {P(2) \over P(1)} + {P(3) \over P(1)} + {P(4) \over P(1)} + \ldots $$ Now say $\small f(a) = {P(a) \over P(1)} $ then the other form $$\small S(a) = f(a)+ f(a+1) +f(a+2) + \ldots $$ hints to an expression involving bernoulli-polynomials or along the EulerMaclaurin-summation-formula. It requires then a "transfer"-function $\small f(x+1)=\varphi(f(x)) $ and the mechanism of indefinite summation.

Perhaps this hint is already enough; I think I'll try some more steps myself later today and extend this answer if needed.

share|cite|improve this answer
Thanks for the input. I had a feeling it may not have a closed form. I figured if anyone could solve it, though, it would be someone on this site :) Cheers – Cody Dec 4 '11 at 14:40

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.