The original question is whether or not $2x^2 ≡ 1 (mod 13)$ has an integer solution.
The way I solved it is:
Let $y = x^2$.
We can conclude that $y = 7+13k$ for $k$ in $Z$. I assert that $7 + 13k$ is never a perfect square.
However, I don't know how to prove it. Any suggestions on how to? Any other ways of solving this question (perhaps using residue classes)?
In $\mathbb F_{13}$ one has $$2x^2=1\iff x^2=2^{11}=7 \space \text{because } 2\cdot2^{11}=1$$ But $7$ is not residu quadratic modulo $13$. In fact, by the law of quadratic reciprocity, we have $$\left(\frac{7}{13}\right)\cdot\left(\frac{13}{7}\right)=(-1)^{\frac{7-1}{2}\cdot\frac{13-1}{2}}=1$$ But $$\left(\frac{13}{7}\right)=\left(\frac{-1}{7}\right)=(-1)^{\frac{7-1}{2}}=-1$$ Consequently $\left(\dfrac{7}{13}\right)$ must be equal to $-1$