[Math] Show that $x^2 – 3y^2 = n$ either has no solutions or infinitely many solutions

diophantine equationselementary-number-theory

I have a question that I have problem with in number theory about Diophantine,and Pell's equations. Any help is appreciated!

We suppose $n$ is a fixed non-zero integer, and suppose that $x^2_0 – 3 y^2_0 = n$, where $x_0$ and $y_0$ are bigger than or equal to zero. Let $x_1 = 2 x_0 + 3 y_0$ and $y_1 = x_0 + 2 y_0$. We need to show that we have $x^2_1 – 3 y^2_1 = n$, with $x_1>x_0$, and $y_1>y_0$. Also, we need to show then that given $n$, the equation $x^2 – 3 y^2 = n$ has either no solutions or infinitely many solutions.
Thank you very much!

Best Answer

The fact that if $x_1=2x_0+3y_0$ then $x_1\gt x_0$ is immediate: you cannot have both $x_0$ and $y_0$ zero; likewise with $y_1$.

That $x_1^2+3y_1^2$ is also equal to $n$ if you assume that $x_0^2 - 3y_0^2=n$ should follow by simply plugging in the definitions of $x_1$ and $y_1$ (in terms of $x_0$ and $y_0$), and chugging.

Finally, what you have just done is show that if you have one solution, you can come up with another solution. Do you see how this implies the final thing you "need to show"?

Related Question