Proposition15.6.1
Doubling integer points on the hyperbola \(x^2-2y^2=1\) yields more integer points.
What is going on algebraically here? The algebra is not hard, but a little dense; follow this proof closely.
Doubling integer points on the hyperbola \(x^2-2y^2=1\) yields more integer points.
Now let's try this with actual points in Sage!
Awesome!
Brahmagupta knew how to do this, though of course he did it both without our geometric interpretation (which was only made possible by Descartes and Fermat's introduction of coordinate systems) and also without the benefit of symbolically representing \(\sqrt{2}\), which provides this alternate description of what we did.
If \((x_0,y_0)\) is a solution to \(x^2-2y^2=1\), then so is \((x_1,y_1)\) where \begin{equation*}(x_0+\sqrt{2}y_0)^2=x_1+\sqrt{2}y_1\, .\end{equation*}
If you were to do the algebra out here, you'd get exactly the same answer as we did above (Exercise 15.7.14).
Notice that once again we seem to have created a new number system, though this time with a square root of a positive, not negative number! (And yes, it turns out that finding solutions to things like this is related to \(\mathbb{Z}[\sqrt{2}]\cdots\))
This precisely corresponds to multiplying a group element by 2, e.g. \begin{equation*}[5]+ [5]\equiv 3\text{ (mod }7)\text{ is the same type of thing as }(3,2)+(3,2)=(17,12)\; .\end{equation*} It turns out that there is a more general formula that corresponds to taking the line through two points and then moving it so that it goes through the original point \((1,0)\):
If \((x_1,y_1)\) and \((x_2,y_2)\) are both solutions of \(x^2-2y^2=1\), then so is \begin{equation*}(x_1 x_2+2y_1 y_2, x_1 y_2+y_1 x_2)\, \end{equation*} If you apply this to two points opposite each other like \((3,2)\) and \((3,-2)\), you will get \begin{equation*}(3\cdot 3+2\cdot 2\cdot (-2),3\cdot (-2)+3\cdot 2)=(1,0)\, ,\end{equation*} which is then the group identity.
This ends up working for any \(n\). Just change all the 2s above to n. Let's see this “by hand” for \(n=3\), where we solve \(x^2-3y^2=1\) with \begin{equation*}2^2-3\cdot 1^2=1\; .\end{equation*} That is, I use \begin{equation*}x'=x^2+3y^2\text{ and }y'=2xy\end{equation*}
The general solution, given two points \((x_1,y_1)\) and \((x_2,y_2)\), would be, for \(n>0\) and not a perfect square, \begin{equation*}x'=x_1x_2+ny_1y_2\text{ and }y'=x_1y_2+x_2y_1\; .\end{equation*}
Even more generally, the same formula works for combining solutions of two different equations like the Pell.
\begin{equation*}\text{If }x_0^2-ny_0^2=k\text{ and }x_1^2-ny_1^2=\ell\end{equation*} \begin{equation*}\text{then }x=x_0x_1+ny_0y_1,\; y=x_0y_1+y_0x_1\text{ solves }x^2-ny^2=k\ell\; .\end{equation*}
This is particularly nice if \(k=\ell=-1\), because getting a solution for that would then give a solution to the Pell equation!
Brahmagupta used analogous techniques for his time (and more sophisticated things) to solve very hard ones, as did the later English mathematicians who answered some challenges of Fermat.
Find a nontrivial solution to \(x^2-61y^2=1\).
Find a nontrivial solution to \(x^2-109y^2=1\).
Considering that Brahmagupta says that finding the solution \(x=1151,y=120\) to the equation \(x^2-92y^2=1\) within a year proved the person “was a mathematician”, we can be very thankful for computers!