$$\begin{matrix} x'=-y \\ y'=-x' \end{matrix} \begin{matrix} x(0)=1\\ y(0)=0 \end{matrix}$$ Calculate with the explicit Euler's method the expression $A=(x_n)^2+(y_n)^2$, where $x_n, y_n$ are the approximations at the step $n$.
The problem can be written as $$\binom{x}{y}'=\begin{pmatrix} 0 & -1 \\ -1 & 0 \end{pmatrix}\binom{x}{y} $$
Applying the explicit Euler's method we get $$\binom{x_{n+1}}{y_{n+1}}=\binom{x_n}{y_n}+h\begin{pmatrix} 0 & -1 \\ -1 & 0 \end{pmatrix}\binom{x_n}{y_n}=\begin{pmatrix} 1 & -h\\ -h & 1 \end{pmatrix}\binom{x_n}{y_n} $$
So we have $$ (x_{n+1})^2+(y_{n+1})^2=(x_n-hy_n)^2+(-hx_n+y_n)^2=(1+h^2)[(x_n)^2+(y_n)^2]-4hx_ny_n$$
How can we find a general formula for $(x_n)^2+(y_n)^2$ ?
For $n=0$ we have $(x_1)^2+(y_1)^2=1+h^2$.
For $n=1$ we have $(x_2)^2+(y_2)^2=(1+h^2)^2-4xhx_1y_1$.