Let $n\geq 2$ be an integer. Consider the solutions of the system $$\begin{cases} n=a+b-c \\ n=a^2+b^2-c^2 \end{cases}$$where $a,b,c$ are integers. Show that there is at least one solution and that the solutions are finitely many.
Source: Italian MO 2017 P2
Tags: algebra, number theory
Let $n\geq 2$ be an integer. Consider the solutions of the system $$\begin{cases} n=a+b-c \\ n=a^2+b^2-c^2 \end{cases}$$where $a,b,c$ are integers. Show that there is at least one solution and that the solutions are finitely many.