$a_1=1,a_{n+1}=\frac{n}{a_n}+\frac{a_n}{n}$. Demostrar que para $n\ge4$, $\lfloor{a_n^2}\rfloor=n$

Question

Definir una secuencia de $\left\lbrace a_{n}\right\rbrace$ $\displaystyle{a_{1} = 1\,,\ a_{n + 1} = {n \over a_n} + {a_n \over n}.\quad}$ demostrar que $n \geq 4,\,\,\left\lfloor a_{n}^{2}\right\rfloor=n$

---

La sustitución $b_{n} = a_{n}^{2}$ podría ser útil, pero yo todavía no he probado la afirmación todavía.

Answer 1

En primer lugar, utilizamos la inducción matemática tienen las siguientes desigualdades

$$\sqrt{n}\le a_{n}\le\dfrac{n}{\sqrt{n-1}},n\ge 3$$

fácil demostrar esta función $$f(x)=\dfrac{x}{n}+\dfrac{n}{x} $% $ #%(0,n) de #%

porque % $ $ is decreasing on $

desde $$f'(x)=-\dfrac{n}{x^2}+\dfrac{1}{n}\le 0$, que $a_{1}=1,a_{2}=2,a_{3}=2$ $ Assmue que % $ $$\sqrt{3}\le a_{3}\le\dfrac{3}{\sqrt{2}}$

entonces $$\sqrt{n}\le a_{n}\le\dfrac{n}{\sqrt{n-1}},n\ge 3$ $ $$a_{n+1}=f(a_{n})\ge f(\dfrac{n}{\sqrt{n-1}}=\dfrac{n}{\sqrt{n-1}}>\sqrt{n+1}$ $

De hecho, podemos demostrar

$$a_{n+1}=f(a_{n})\le f(\sqrt{n})=\dfrac{n+1}{\sqrt{n}}$ $ desde $ de $$a_{n}\le \sqrt{n+1},n\ge 4$ % que $$a_{n+1}=f(a_{n})\ge f(\dfrac{n}{\sqrt{n-1}})=\dfrac{n}{\sqrt{n-1}},n\ge 3$$ y Nota $$a_{n}\ge\dfrac{n-1}{\sqrt{n-2}},n\ge4$ $

se suffces demostrar que $$a_{n+1}=f(a_{n})\le f\left(\dfrac{n-1}{\sqrt{n-2}}\right)=\dfrac{(n-1)^2+n^2(n-2)}{(n-1)n\sqrt{n-2}}$ $ $$\dfrac{(n-1)^2+n^2(n-2)}{(n-1)n\sqrt{n-2}}\le\sqrt{n+2},n\ge 4$$ $$\Longleftrightarrow n^3-n^2-2n+1<(n^2-n)\sqrt{n^2-4}$ $

Answer 2

$\newcommand{\+}{^{\daga}}% \newcommand{\ángulos}[1]{\left\langle #1 \right\rangle}% \newcommand{\llaves}[1]{\left\lbrace #1 \right\rbrace}% \newcommand{\bracks}[1]{\left\lbrack #1 \right\rbrack}% \newcommand{\dd}{{\rm d}}% \newcommand{\isdiv}{\,\left.\a la derecha\vert\,}% \newcommand{\ds}[1]{\displaystyle{#1}}% \newcommand{\equalby}[1]{{#1 \cima {= \cima \vphantom{\enorme}}}}% \newcommand{\expo}[1]{\,{\rm e}^{#1}\,}% \newcommand{\fermi}{\,{\rm f}}% \newcommand{\piso}[1]{\,\left\lfloor #1 \right\rfloor\,}% \newcommand{\ic}{{\rm i}}% \newcommand{\imp}{\Longrightarrow}% \newcommand{\cy}[1]{\left\vert #1\right\rangle}% \newcommand{\pars}[1]{\left( #1 \right)}% \newcommand{\partiald}[3][]{\frac{\partial^{#1} #2}{\parcial #3^{#1}}} \newcommand{\pp}{{\cal P}}% \newcommand{\raíz}[2][]{\,\sqrt[#1]{\,#2\,}\,}% \newcommand{\sech}{\,{\rm sech}}% \newcommand{\sgn}{\,{\rm sgn}}% \newcommand{\totald}[3][]{\frac{{\rm d}^{#1} #2}{{\rm d} #3^{#1}}} \newcommand{\ul}[1]{\underline{#1}}% \newcommand{\verts}[1]{\left\vert #1 \right\vert}% \newcommand{\yy}{\Longleftrightarrow}$ $\tt{\large\it\mbox{Hint:}}\ \mbox{For}\ n > 1:$ $$ a_{n + 1} = {n \sobre a_{n}} + {a_{n} \over n}\quad\imp\quad a_{n}^{2} - \pars{na_{n + 1}}a_{n} + n^{2} = 0 $$ Desde $a_{n} \in {\mathbb R}$, vamos a tener $\pars{na_{n + 1}}^{2} - 4n^{2} \geq 0\quad \imp\quad a_{n + 1} \geq 2$ y $$ a_{n} = \bracks{\vphantom{\LARGE A^{^{A}}}% {a_{n + 1} \over 2} - \raíz{\pars{a_{n + 1} \over 2}^{2} - 1}}\,n = {n \sobre a_{n + 1}/2 + \raíz{\pars{a_{n + 1}/2}^{2} - 1}} $$ $$ \mbox{Con}\quad b_{n} \equiv {a_{n} \over 2}\,,\qquad b_{1} = {1 \over 2}\,,\quad b_{n} = {n/2 \sobre b_{n + 1} + \raíz{b_{n + 1}^{2} - 1}}\,; \qquad b_{n} \geq 1\,,\quad n \geq 2 $$ Tenemos que probar que $\floor{b_{n}^{2}} = n/4$ al $n \geq 4$. Observe que $b_{n} \leq n/2$.