Show that this is true for all $n \ge 1$
$2\ln(2) - 1 \le \frac1{n} \sum_{k=1}^{n} \ln(1 + \frac{k}{n}) \le 2\ln(2) - 1 + \frac{\ln(2)}{n}$
I've no idea what to do here but here is how I've tried so far. I feel like I wanna approximate the sum by using Cauchy's integral 7,test. So I wanna rewrtie it using an integral.
$\int^{k/n} \ln (1 + x) {\rm d}x$
But the problem is I don't know what lower bound I should use. And even if I did, how do I continue? This feels like a dead end. Am I even on the right path?
The first half of the inequality can be solved using the AM-GM inequality.
$$\frac{1}{n}\sum_{k=1}^n\ln\left(1+\frac{k}{n}\right)$$ $$=\frac{1}{n}\ln\left(\prod_{k=1}^n\left(1+\frac{k}{n}\right)\right)$$ $$=\ln\left(\prod_{k=1}^n\left(1+\frac{k}{n}\right)\right)^{\frac{1}{n}}$$ $$=\ln(GM)$$ where $GM$ is the geometric mean of $\left(1+\frac{1}{n}\right)$, $\left(1+\frac{2}{n}\right)$, $\left(1+\frac{3}{n}\right)$, ... , $\left(1+\frac{n}{n}\right)$ $$\\$$ $$2\ln(2)-1$$ $$=\ln(2)^2-\ln(e)$$ $$=\ln(4)-\ln(e)$$ $$=\ln\left(\frac{4}{e}\right)$$ $$\approx\ln(1.4715)$$ $$\\$$ Arithmetic mean of $\left(1+\frac{1}{n}\right)$, $\left(1+\frac{2}{n}\right)$, $\left(1+\frac{3}{n}\right)$, ... , $\left(1+\frac{n}{n}\right)$ is $\left(1.5+\frac{1}{2n}\right)$ $$\\$$ $$AM \le GM$$ $$\implies \ln(AM) \le \ln(GM)$$ Since $1.4715 \le AM$, $\ln(1.4715) \le \ln(AM)$ $$\implies \ln(1.4715) \le \ln(GM)$$ Hence proving the first half of the inequality.