I have been discussing the fastest and most efficient ways of solving QDEs in a separate question record (Alternative method to solve quadratic Diophantine equations). However, as suggested by individ, I want to shunt the discussion onto new tracks. Note also, that I am aware of similar entries related to this topic (like Solving Pell's equation(or any other diophantine equation) through modular arithmetic.) but my questions are slightly different and the special case I am interested in (see below in bullets) does not match the previous QDEs discussed.
Again we have: $$Ax^2 + Bxy + Cy^2 + Dx + Ey + F = 0 $$
where $ A,B,C,D,E,F \in \mathbb Z$
Individ suggested that instead of following a general algorithm proposed by Dario Alpern (https://www.alpertron.com.ar/METHODS.HTM) a more elegant and computationally faster may be a method of transforming QDE into some form of Pell's equation.
The questions are:
- Can any QDE be transformed into some form of Pell's equation? If yes, please provide guidelines.
- If not, then at least is it feasible for $A=1, B=0, C=-1, D=D_0, E=0, F=F_0$ , where $ D_0 > F_0 $ and $ F_0 > 1 $? If yes, then please provide guidelines how to do this at least in outline.
- Does such transformations into Pell's yield any substantial advantage in terms of solving QDE over Alpern's guidelines? This is perhaps the most crucial question -- Does solving QDE through Pell's transformation involve finding integer divisors of some linear combination of $D$ and $F$ during the solving process? If so, then the whole idea seems pointless from computational perspective.