# Logarithm limit, almost Riemann sum $\lim\limits_{n\to\infty}\frac1n\sum\limits_{k=1}^n\log\frac kn=-1$

I want to show that $\lim\limits_{n\to\infty}\frac{1}{n}\sum\limits_{k=1}^n\log\frac{k}{n}=-1$.

Now I could say that $\lim\limits_{n\to\infty}\frac{1}{n}\sum\limits_{k=1}^n\log\frac{k}{n}=\int_0^1\log xdx$ but I can't as $\log x$ isn't uniform continuous on the given interval. I found a way which goes over the convergence radius of a power series connected to the term in the limit, but I think one could just make the argument with the riemann sum work somehow?!

• I do not know if it is a way to use Riemann sums, but note that your sum is $S_n=(\log n!-n\log n)/n$, so Stirling's formula can be a way to the solution.... – Kelenner Aug 7 '16 at 12:10
• Thanks, but I really want to know if the 'riemann sum way' would work somehow, as the integral has the same value! – user359874 Aug 7 '16 at 13:43
• Why is this 'almost' Riemann sum; isn't it usually solved using this very method? – StubbornAtom Aug 7 '16 at 14:23
• @StubbornAtom What do you mean? I thought you can only go over to the integral in case the function is uniform continuous? – user359874 Aug 7 '16 at 17:06

Hint: Draw the graph of $\log x$ and see that the sum $\sum_{k=1}^n \frac{1}{n}\log(k/n)$ represents the sum of the area of boxes "under" the graph of $\log x$. Then try to estimate the error between the sum and $\int_{1/n}^1 \log x dx$ by finding another sum that represents the area of boxes that cover the graph of $\log x$ from $1/n$ to $1$. E.g. for the interval $[(n-1)/n, 1]$ do not use a box of height $0$ (as is used in your sum), but use a box of height $\log((n-1)/n)$.

Claim: If $f$ is monotone on $(0,1],$ and the improper integral $\int_0^1 f$ converges, then

$$\int_0^1 f = \lim_{n\to \infty} \sum_{k=1}^{n}f(k/n)(1/n).$$

Proof: WLOG $f\ge 0$ and $f$ is decreasing. Then

$$\int_{1/n}^1 f \le \sum_{k=1}^{n}f(k/n)(1/n) \le \int_0^1 f.$$

This follows by staring down areas of rectangles and using the fact that $f$ is nonnegative and decreasing. The result follows by letting $n\to \infty$ and using the squeeze theorem.

In our problem we have $f(x) = \ln x.$ So $f$ is monotone and the convergence of $\int_a^1 \ln x\, dx$ to $-1$ as $a\to 0^+$ follows from the fact that $a\ln a \to 0.$ Therefore the desired limit follows from the claim.

There is actually surprisingly one quite simple way to find the limit in this particular case using L'Hospitals.

$$\lim_{n\to\infty} \frac{\sum_{k=1}^n \log(\frac{k}{n})}{n} = -\frac{\infty}{\infty}$$

As you can see this is already in L'hospitals format. Taking the derivative of the top and bottom to find the limit becomes. $$\lim_{n\to\infty}\frac{\sum_{k=1}^n -\frac{1}{n}}{1}$$

And because the Sum goes through the sum 1 to n times (n times) so it will add $$-\frac{1}{n}$$ n times. So the limit becomes $$\lim_{n\to\infty} n(-\frac{1}{n}) = -1$$ From this you can prove that the limit is equal to -1.
{"ft_lang_label":"__label__en","ft_lang_prob":0.85691804,"math_prob":0.9996231,"size":465,"snap":"2019-51-2020-05","text_gpt3_token_len":154,"char_repetition_ratio":0.12798265,"word_repetition_ratio":0.0,"special_character_ratio":0.29892474,"punctuation_ratio":0.048543688,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000023,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-11T14:20:34Z\",\"WARC-Record-ID\":\"<urn:uuid:5de0c255-1328-4605-a72d-6758d0a320cd>\",\"Content-Length\":\"148665\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:cd7ed7be-30ca-46a8-8d78-c885d1d9e0f8>\",\"WARC-Concurrent-To\":\"<urn:uuid:bb4a87eb-b590-4eef-9d9a-90bd9a30feae>\",\"WARC-IP-Address\":\"151.101.65.69\",\"WARC-Target-URI\":\"https://math.stackexchange.com/questions/1885090/logarithm-limit-almost-riemann-sum-lim-limits-n-to-infty-frac1n-sum-limits/1885314\",\"WARC-Payload-Digest\":\"sha1:GH6MVTBIPBT7HDUMYTEKFLUYLSDIKKCK\",\"WARC-Block-Digest\":\"sha1:2NQA5NDNHX6LAN5KZY5RZOPMPUWP7QYG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575540531917.10_warc_CC-MAIN-20191211131640-20191211155640-00512.warc.gz\"}"}