Initially I faced with a question $$\sqrt{2\sqrt{3\sqrt{4...\sqrt{N}}}} < 3$$ which is not hard to prove by induction.
But if taking logarithm on both sides of this inequality, we get $\sum_{k=0}^{\infty} \frac{\log(1+k)}{2^k} < \log3$.
Is there any way to prove this series inequality? Or evaluate this series?
I tried to use series of $\log(1+k)$. And I got $\sum_{k=0}^{\infty} \frac{\log(1+k)}{2^k} < \sum_{k=0}^{\infty} \frac{k}{2^k} =2$, which gives a larger upper bound.
A surprising fact is that the more term we use for the series of $\log(1+k)$, the larger upper bound we will get.
Hint: Once you have an upper bound, you can try using a couple terms of the actual sequence and then using the bound. So, for any positive integer $N$,
$$\sum_{k=0}^{\infty} \frac{\log(1+k)}{2^k} =\sum_{k=0}^N \frac{\log(1+k)}{2^k} + \sum_{k=N+1}^{\infty} \frac{\log(1+k)}{2^k} < \sum_{k=0}^N\frac{\log(1+k)}{2^k} + \sum_{k=N+1}^{\infty} \frac{k}{2^k}$$