Đặt \(\dfrac{u_n}{n+1}=v_n\)

\(GT\Rightarrow\left\{{}\begin{matrix}v_1=\dfrac{u_1}{1+1}=1\\v_{n+1}=\dfrac{1}{4}v_n,\forall n\in N\text{*}\end{matrix}\right.\)

\(\Rightarrow v_n=\dfrac{1}{4}^{n-1},\forall n\in N\text{*}\)

\(\Rightarrow u_n=\left(n+1\right).\dfrac{1}{4}^{n-1},\forall n\in N\text{*}\)

Với \(n>1\): 

\(n\left(n^2-1\right)u_n=u_1+2u_2+...+\left(n-1\right)u_{n-1}\) (1)

\(\Leftrightarrow n^3-n.u_n=u_1+2u_2+...+\left(n-1\right)u_{n-1}\)

\(\Leftrightarrow n^3.u_n=u_1+2u_2+...+\left(n-1\right)u_{n-1}+n.u_n\) (2)

Thay n bởi \(n-1\) vào (2):

\(\Rightarrow\left(n-1\right)^3u_{n-1}=u_1+2u_2+...+\left(n-1\right)u_{n-1}\) (3)

Từ (1) và (3):

\(\Rightarrow n\left(n^2-1\right)u_n=\left(n-1\right)^2u_{n-1}\)

\(\Leftrightarrow n\left(n+1\right)u_n=\left(n-1\right)^2u_{n-1}\)

\(\Rightarrow u_n=\dfrac{\left(n-1\right)^2}{\left(n+1\right)n}u_{n-1}=\dfrac{\left(n-1\right)^2}{\left(n+1\right)n}.\dfrac{\left(n-2\right)^2}{n\left(n-1\right)}u_{n-2}=...=\dfrac{\left(n-1\right)^2\left(n-2\right)^2....1^2}{\left(n+1\right)n.n\left(n-1\right)...3.2}u_1\)

\(\Rightarrow u_n=\dfrac{\left[\left(n-1\right)!\right]^2}{\dfrac{\left(n+1\right).n^2\left[\left(n-1\right)!\right]^2}{2}}u_1=\dfrac{4}{n^2\left(n+1\right)}\) 

Công thức này chỉ đúng với \(n\ge2\)

\(u_2=\sqrt{2}\left(2+3\right)-3=5\sqrt{2}-3\)

\(u_3=\sqrt{\dfrac{3}{2}}.5\sqrt{2}-3=5\sqrt{3}-3\)

\(u_4=\sqrt{\dfrac{4}{3}}.5\sqrt{3}-3=5\sqrt{4}-3\)

....

\(\Rightarrow u_n=5\sqrt{n}-3\)

\(\Rightarrow\lim\limits\dfrac{u_n}{\sqrt{n}}=\lim\limits\dfrac{5\sqrt{n}-3}{\sqrt{n}}=5\)

\(\left(n+1\right)u_{n+1}=\dfrac{1}{2}nu_n+n+2\)

\(\Leftrightarrow\left(n+1\right)u_{n+1}-2\left(n+1\right)=\dfrac{1}{2}\left[nu_n-2n\right]\)

Đặt \(n.u_n-2n=v_n\Rightarrow\left\{{}\begin{matrix}v_1=-1\\v_{n+1}=\dfrac{1}{2}v_n\end{matrix}\right.\)

\(\Rightarrow v_n=-1.\left(\dfrac{1}{2}\right)^{n-1}\Rightarrow n.u_n-2n=-\dfrac{1}{2^{n-1}}\)

\(\Rightarrow u_n=2-\dfrac{1}{n.2^{n-1}}\)

Ta có: \(u_n>2020\) với mọi \(n\in N\text{*}\) \(\left(\text{*}\right)\)

Thật vậy, dễ thấy \(u_1=2021>2020\)

Giả sử \(\left(\text{*}\right)\) đúng với \(n=k\left(k\ge1\right)\)

\(\Rightarrow u_k>2020\)\(\Rightarrow u_{k+1}=\left[1-\dfrac{1}{\left(k+1\right)^2}\right]u_k+\dfrac{2020}{\left(k+1\right)^2}\)

\(>\left[1-\dfrac{1}{\left(k+1\right)^2}\right].2020+\dfrac{2020}{\left(k+1\right)^2}=2020\)

\(\Rightarrow\left(\text{*}\right)\) đúng với \(n=k+1\)

Do đó theo nguyên lý quy nạp ta có đpcm.

Lại có:

\(u_{n+1}-u_n=\dfrac{2020}{\left(n+1\right)^2}-\dfrac{u_n}{\left(n+1\right)^2}< 0\) với mọi \(n\in N\text{*}\)

\(\Rightarrow\left(u_n\right)\) là dãy giảm

\(\left(u_n\right)\) là dãy giảm và bị chặn nên \(\left(u_n\right)\) là dãy hội tụ

Đặt \(limu_n=L\)

\(\Rightarrow\left\{{}\begin{matrix}2020\le L\le2021\\L=\left[1-\dfrac{1}{\left(n+1\right)^2}\right].L+\dfrac{2020}{\left(n+1\right)^2}\end{matrix}\right.\)\(\Rightarrow L=2020\left(tm\right)\)

Vậy \(limu_n=2020\)

Ta có: \(u_n>2020\) với mọi \(n\in N\text{*}\) \(\left(\text{*}\right)\)

Thật vậy, dễ thấy \(u_1=2021>2020\)

Giả sử \(\left(\text{*}\right)\) đúng với \(n=k\left(k\ge1\right)\)

\(\Rightarrow u_k>2020\)\(\Rightarrow u_{k+1}=\left[1-\dfrac{1}{\left(k+1\right)^2}\right]u_k+\dfrac{2020}{\left(k+1\right)^2}\)

\(>\left[1-\dfrac{1}{\left(k+1\right)^2}\right].2020+\dfrac{2020}{\left(k+1\right)^2}=2020\)

\(\Rightarrow\left(\text{*}\right)\) đúng với \(n=k+1\)

Do đó theo nguyên lý quy nạp ta có đpcm.

Lại có:

\(u_{n+1}-u_n=\dfrac{2020}{\left(n+1\right)^2}-\dfrac{u_n}{\left(n+1\right)^2}< 0\) với mọi \(n\in N\text{*}\)

\(\Rightarrow\left(u_n\right)\) là dãy giảm

\(\left(u_n\right)\) là dãy giảm và bị chặn nên \(\left(u_n\right)\) là dãy hội tụ

Đặt \(limu_n=L\)

\(\Rightarrow\left\{{}\begin{matrix}2020\le L\le2021\\L=\left[1-\dfrac{1}{\left(n+1\right)^2}\right].L+\dfrac{2020}{\left(n+1\right)^2}\end{matrix}\right.\)\(\Rightarrow L=2020\left(tm\right)\)

Vậy \(limu_n=2020\)