There is a sequence given by:$\ \ h(0) = \frac{2}{3} ,\ \ h(n) = h(n-1)^2 - 2 \ \ $for $n \in\mathbb{N^{+}}$.
Let's have a look a the first values: $$h(0)=\ \ \frac{2}{3}\\ \ \ \ h(1) =-\frac{14}{9}\\ \ \ h(2) = \ \ \frac{34}{81}\\ \ \ \ \ \ \ h(3) =-\frac{11966}{6561} \\ \ \ \ \ \ \ \ \ \ h(4)=\frac {57091714}{43046721}\\ $$ $...$
Terms are growing fast, I would not post any further.
Interesting for me is the change in the signs. At first glance, do you expect alternating sign changes?
The signs I determined for $ h(n) $ for $n=0..31 \ \ $:
$$ [1, -1, 1, -1, 1, -1, -1, 1, 1, -1, -1, 1, -1, 1, 1, -1, -1, -1, -1, 1, 1, 1, 1, -1, -1, -1, -1, 1, -1, 1, -1, -1]$$
...then my computer was running out of memory. He needs almost 4 GByte for the last operation.
Question: Is it possible to determine if $h(n)$ is positive or negative for increasing values of $n$? For example for $n=100$ or even $n=1000000$?
Question: Is it true that for all $h(0)$ with $0
not$ \sqrt{2}$, the signs of $h(n)$ change infinitely often?
Thanks in advance!