This is the limit: \begin{equation} \lim_{n\to+\infty}\sqrt[n]{n}\cdot\sqrt[n+1]{n+1}...\sqrt[2n]{2n} \end{equation} I tried to rearrange the terms to apply the geometric mean theorem but my attempt was not successful. Any way to solve this will be fine.
2026-04-04 15:19:11.1775315951
On
How do you evaluate the limit of this sequence involving n-th roots?
100 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
3
There are 3 best solutions below
3
On
We have that
$$\sqrt[n]{n}\cdot\sqrt[n+1]{n+1}...\sqrt[2n]{2n}=e^{\sum_{k=n}^{2n}\frac{\log k}{k}}$$
and by this result
we obtain
$$\sum_{k=n}^{2n}\frac{\log k}{k}=\sum_{k=1}^{2n}\frac{\log k}{k}-\sum_{k=1}^{n-1}\frac{\log k}{k} =\frac{(\log 2n)^2}{2}-\frac{(\log (n-1))^2}{2} + O\left(\frac{\log(n)}{n}\right)$$
with
$$(\log 2n)^2-(\log (n-1))^2=\left(\log \left(\frac{2n}{n-1}\right)\right)(\log (2n(n-1)) \to \infty$$
More simply we have
$$\sum_{k=n}^{2n}\frac{\log k}{k} \ge n \cdot \frac{\log (2n)}{2n}=\frac{\log (2n)}{2} $$
and therefore
$$e^{\sum_{k=n}^{2n}\frac{\log k}{k}} \ge e^{\frac{\log (2n)}{2}}\to \infty$$
$$\prod_{k=n}^{2n}\sqrt[k]k=e^{\sum\limits_{k=n}^{2n}\frac{\ln{k}}{k}}>e^{\ln{n}\sum\limits_{k=n}^{2n}\frac{1}{k}}=n\cdot e^{\sum\limits_{k=n}^{2n}\frac{1}{k}}\rightarrow+\infty$$ because $$\lim_{n\rightarrow+\infty}\sum\limits_{k=n}^{2n}\frac{1}{k}=\lim_{n\rightarrow+\infty}\left(\frac{1}{1+\frac{0}{n}}+\frac{1}{1+\frac{1}{n}}+...+\frac{1}{1+\frac{n}{n}}\right)\frac{1}{n}=$$ $$=\int\limits_0^1\frac{1}{1+x}dx=\ln(1+x)|_0^1=\ln2.$$