0

I have the recursive sequence such as $x_{n+2}=\sqrt{x_{n+1}x_{n}}$ I've tried to solve it considering some solutions in the form $x_n=A* \lambda^n $ but with no results. Can someone explain me how to solve it, just some hints?

Anne
  • 2,931

1 Answers1

1

This is a suggestion. I have not tried to complete all the details but it seems that it will work. If $a_n:=\log(x_n)$ you obtain

$$ a_{n+1}=\frac12 a_{n+1} + \frac12 a_n$$ this can be express as

$$ \begin{pmatrix} a_{n+2}\\ a_{n+1} \end{pmatrix} =\begin{pmatrix} \frac12 & \frac12\\ 1 & 0 \end{pmatrix} \begin{pmatrix} a_{n+1} \\ a_n \end{pmatrix} $$ Decomposing the matrix above as $P^{-1}\operatorname{diag}(-\frac12, 1) P$ for some appropriate $P$ will give a solution for $[a_{n+2}\, a_{n+1}]^\top$ in terms of initial conditions $[a_1\, a_0]^\top$. You then may recover an expression for $x_{n+2} = \exp(a_{n+2})$

Mittens
  • 39,145
  • excuse me, but this is an exercize from the Analisys I book. is it possible to have a solution without no more than analisys I notions? – Anne Feb 13 '20 at 18:11
  • you don't have to use a little matrix algebra if you so prefer. Still, it is a standard thing to use when dealing with linear recursive sequences. It lightens the calculations a bit. – Mittens Feb 13 '20 at 18:16
  • if I put $a_n=log (x_n)$ my result is $a_{n+1}-a_n-4=0$ and I don't see how it can be your system – Anne Feb 13 '20 at 18:23
  • 2
    No, its $a_{n+2} = {1 \over 2} (a_{n+1}+a_n)$. – copper.hat Feb 13 '20 at 18:27