Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Compute $$ \lim\limits_{n\to\infty}\left(\sqrt[n]{\log\left|1+\left(\dfrac{1}{n\cdot\log\left(n\right)}\right)^k\right|}\right). $$ What I have: $$ \forall\ x\geq 0\ :\ x- \frac{x^2}{2}\leq \log(1+x)\leq x. $$ Apply to get that the limit equals $1$ for any real number $k$.

Is this correct? Are there any other proofs?

share|cite|improve this question
You are using both notations $\log$ and $\ln$. I assume that they are the same? – Sammy Black Nov 6 '13 at 16:48
@AntonioVargas I am using the Squeeze Theorem. – Ahaan S. Rungta Nov 6 '13 at 17:09
@SammyBlack Yes, thanks! Edited. – Ahaan S. Rungta Nov 6 '13 at 17:09
up vote 3 down vote accepted

Yes it works, here's another proof using a little more sofisticate tool (in this case unnecessary, but sometimes more useful).

By Stolz-Cesaro if $ (x_n) $ is a positive sequence and $$ \lim_n \dfrac{x_{n+1}}{x_n} = l $$ then $$ \lim_n \sqrt[n]{x_n} = l.$$

Taking as $(x_n)$ the sequence you defined, an easy calculation shows that $$ \dfrac{x_{n+1}}{x_n} \rightarrow 1,$$ therefore the thesis.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.