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 have tried for a long time on this: $$\sum_{n=1}^{\infty}\ln\left(1+\frac{1}{n}\right)\ln\left(1+\frac{1}{2n}\right)\ln\left(\frac{1}{2n+1}\right)$$

Even I have no idea whether it could be calculate or not

share|cite|improve this question
1  
It is not hard to prove convergence. Would be pessimistic about explicit closed-form expression. – André Nicolas Jan 8 '13 at 4:44
    
yes, it's easy to prove convergence. here is another tough problem I haven't solved:calculate the sum $\sum_{n\in S}\frac{1}{n}$, where $S=\{n|n\in \mathbb{N} \text{ and } n \text{ has no digits } 9\}$, that is for example $9, 19, 92 \notin S$, $3,11,18\in S$ – Larry Eppes Jan 8 '13 at 5:05
    
Does that even converge? – user7530 Jan 8 '13 at 5:10
    
Apparently so: en.wikipedia.org/wiki/Kempner_series – user7530 Jan 8 '13 at 5:13
2  
This series was a problem from the second day 2011 International Math Competition. See here: imc-math.org.uk/index.php?year=2011&item=problems – Cody Feb 17 '13 at 13:39

Your Answer

 
discard

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

Browse other questions tagged or ask your own question.