Limits And Summations!

Calculus Level 5

L = lim n 1 n ! n log a ( k = 1 a n ( 1 + k ) a n ) \large L = \lim_{n \to \infty} \dfrac{1}{\sqrt[n]{n!}} \log_a \left( \displaystyle \sum_{k=1}^{a^n} (1+k)^{a^{-n}} \right)

Let a > 1 a>1 be any positive integer , find the value of 100 L \lfloor 100L \rfloor .

Notation : \lfloor \cdot \rfloor denotes the floor function .


The answer is 271.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Satyajit Mohanty
Jul 25, 2016

Since

lim n ln ( 1 n 2 n n n n ) = lim n 1 n ( k = 1 n ln ( k n ) ) = 0 1 ln ( x ) d x = 1 \displaystyle \lim_{n \to \infty} \ln \left( \sqrt[n]{\dfrac{1}{n} \cdot \dfrac{2}{n} \cdots \dfrac{n}{n} } \right) = \lim_{n \to \infty} \dfrac{1}{n} \left( \sum_{k=1}^n \ln \left( \dfrac{k}{n} \right) \right) = \int_0^1 \ln (x) \ \mathrm{d}x = -1

We have 1 n ! n e n \dfrac{1}{\sqrt[n]{n!}} \sim \dfrac{e}{n} as n n \to \infty . Thus, it suffices to prove that log a ( k = 1 a n ( 1 + k ) a n ) n \displaystyle \log_a \left( \sum_{k=1}^{a^n} (1+k)^{a^{-n}} \right) \sim n as n n \to \infty .

Now,

a n 2 1 / a n k = 1 a n ( 1 + k ) a n a n ( 1 + a n ) 1 / a n a^n \cdot 2^{1/a^n} \leq \sum_{k=1}^{a^n} (1+k)^{a^{-n}} \leq a^n (1+a^n)^{1/a^n}

and therefore using the fact that log a \log_a is increasing,

n + log a ( 2 ) a n log a ( k = 1 a n ( 1 + k ) a n ) n + n a n + 1 a n log a ( 1 + 1 a n ) n + \dfrac{\log_a (2)}{a^n} \leq \log_a \left( \sum_{k=1}^{a^n} (1+k)^{a^{-n}} \right) \leq n + \dfrac{n}{a^n} + \dfrac{1}{a^n} \log_a \left( 1 + \dfrac{1}{a^n} \right) .

The squeeze principle now shows that

lim n 1 n log a ( k = 1 a n ( 1 + k ) a n ) = 1 \large \lim_{n \to \infty} \dfrac{1}{n} \log_a \left( \displaystyle \sum_{k=1}^{a^n} (1+k)^{a^{-n}} \right) = 1

And thus we obtain L = e 2.718 L = e \approx 2.718

Exactly the same as what I did!

Is there no way get asymptotically tighter bounds? (the upper and lower bound in the solution are quite far apart)

A Former Brilliant Member - 4 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...