I found some resources that talk about algorithms for finding fundamental solutions to the Pell-like equation $$ x^{2} - dy^{2} = k $$ for $d \in \mathbb{N}$ and $k \in \mathbb{Z}$. However, I'm struggling to find results (if there are any) that will tell me if the above equation is solvable given certain $d,k$. A quick search on Math.SE yields a bunch of questions about specific Pell-like equations.... Does anyone have any good resources/papers related to this question? Any help is greatly appreciated.
2026-04-02 10:32:50.1775125970
Solvability of the Pell-like equation $x^{2}-dy^{2} = k$
205 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
You have not said anything about the size of $k.$ So: if you can find a (even) number $\beta$ such that $$ \beta^2 \equiv 4d \pmod {4k}, $$ so that $$ \beta^2 = 4d + 4kt $$ for integer $t.$ So, the discriminant of binary form $$ f(x,y) = k y^2 + \beta xy -t y^2 $$ is $4d.$ There is a process for reducing an indefinite binary form and seeing what class it is in. If $f$ is equivalent to $x^2 - d y^2,$ then $k$ is (primitively) represented by $x^2 - d y^2.$ This does require knowing how to find the complete cycle of a reduced indefinite form. I got the whole business from BUELL
added: let us take notation $$ \langle a, b, c \rangle $$ to refer to the quadratic form $$ f(x,y) = a x^2 + b xy + c y^2 $$ The discriminant is $\Delta = b^2 - 4ac.$ When this is positive but not a square, the form is indefinite. Buell gives the original definition of Gauss and Lagrange for when such a form is reduced.
Proposition: the indefinite (integer coefficient) form $ \langle a, b, c \rangle $ is reduced if and only if both $$ ac < 0 \; \; \; \; \; \mbox{AND} \; \; \; \; \; \; b > |a+c| $$ I know of just one book where this is printed, by Franz Lemmermeyer, who is active on this site and MO. I should give an example, most people haven't seen the cycles of reduced forms: