Convergence N'th Harmonic number minus the Natural Logarithm of N. [duplicate]

$\qquad$

The best thing is to just plot the graphic of both functions, and to interpret it. Notice how the first blue area on the left is smaller than $1-\dfrac12$, the second is smaller than $\dfrac12-\dfrac13$, the third is smaller than $\dfrac13-\dfrac14$, etc. At the same time, all these quantities are positive, meaning that the series is strictly increasing. But it is also bounded by $1$, since $\bigg(1-\dfrac12\bigg)+\bigg(\dfrac12-\dfrac13\bigg)+\bigg(\dfrac13-\dfrac14\bigg)+\ldots$ is telescopic in nature. And since it is both bounded and monotonous, it follows that it converges.

From the error estimate for the rectangle rule:

$$0 < 1/k - \int_k^{k+1} 1/x dx = \frac{1}{2c_k^2}$$

where $c_k \in (k,k+1)$. So

$$0 < 1/k - \int_k^{k+1} 1/x dx < \frac{1}{2k^2}.$$

Therefore

$$\sum_{k=1}^n 1/k - \ln n = \sum_{k=1}^n 1/k - \int_1^n 1/x dx < \sum_{k=1}^n \frac{1}{2k^2} < \sum_{k=1}^\infty \frac{1}{2k^2} = \frac{\pi^2}{12}.$$

Also, this quantity is increasing, so from the monotone convergence theorem there is a limit. This limit is by definition the Euler-Mascheroni constant, and this argument shows that it is less than $\frac{\pi^2}{12}$. One can repeat the argument, using $c_k < (k+1)$ to get a lower bound of $\sum_{k=2}^\infty \frac{1}{2k^2} = \frac{\pi^2}{12}-\frac{1}{2}.$