Given a positive integer $k$. Prove that $\forall x;y \in \mathbb{N}; 2k^2-1 \le x <y <2(k+1)^2-1$ then $\frac{x^2+y^2}{2}$ cannot be a perfect square.
My incomplete solution:
From the given conditions, I suppose that it's impossible to solve this by finding the bounds of $\frac{x^2+y^2}{2}$ as $ (2k^2-1)^2 < \frac{x^2+y^2}{2} < (2k^2+4k)^2$.
Therefore, it occurs to me that whether $\frac{x^2+y^2}{2}$ can be a perfect square or not depends on the value of $x;y$. So I tried finding a general formula for $x;y$ so that $\frac{x^2+y^2}{2}$ can be a square of an integer.
Then, I discovered that $x=p(n^2+2mn-m^2);y=p(m^2+2mn-n^2)$ for $p \in \mathbb{N^*};m;n \in \mathbb{N^*}; (m;n)=1; m>n$.
So $2k^2-1 \le p(n^2+2mn-m^2); 2k^2+4k \ge p(m^2+2mn-n^2)$.
But I'm too stupid to continue this solution. So I hope someone would try to solve for me and at your pleasure, I hope you will let me know some books or articles so that I can train on this kind of diophantine equation or some other related kinds of number theory like this.