Let $x_{n+1}=x_n+2y_n$ and $y_{n+1}=y_n-x_n$, where $x_1=1$ and $y_1=-1$.
I tried proving by contradiction, I tried by induction, I got nothing.
This is a question I had on an exam, I didn't manage to solve it, and afterwards I spent one day thinking about it and still came up with nothing.
Please note that a full solution is not necessary, if you could just provide a hint, that would be awesome.
The origin of the question was to show that $\left( \begin{array}{ccc} 1 & 2 \\ -1 & 1 \\ \end{array} \right)^n$ has no zero elements for any positive integer $n$.
The pair $(x_n, y_n)^T$ is equal to $$ \begin{pmatrix} 1 & 2 \\ -1 & 1 \end{pmatrix}^{n-1} \begin{pmatrix} 1 \\ -1 \end{pmatrix}. $$ If you want to prove that there is no $n$ s.t. $x_n=y_n=0$, then you just use that fact that a regular matrix never maps a nonzero vector to zero. If you want to prove that for any $n$ neither $x_n$ nor $y_n$ is zero, do the eigenvalue decomposition and compute $x_n, y_n$ exactly.