Non-linear Diophantine equation on integer quadruples

Question

Find all integer quadruples $\{a,b,c,d\}$ such that

$$ad = b + c$$

$$bc = a^2 - d$$

Working $\bmod 8$ (very messy) gives $d = 3 - 8k \quad \forall k \in \mathbb{N}$.

Numerical searching has so far only found $d = -5$ works.

Answer 1

For the system. $$\left\{\begin{aligned}&ad=b+c\\&bc=a^2-d\end{aligned}\right.$$

We reduce to one equation.

$$c=ad-b$$

It is necessary to solve the General Pell equation.

$$a^2-dab+b^2=d$$

You can make the change. $a\longrightarrow{a+tb}$

$$a^2+(2t-d)ab+(t^2+1)b^2=d$$

Then you can use this formula. And to reduce to writing the solution in the equation Pell. It is only necessary that the root was intact at least. http://www.artofproblemsolving.com/community/c3046h1048219 It is only necessary that the root was intact at least. $$\sqrt{\frac{d}{(t+1)^2+1-d}}=k$$