Explicit complete solution in integers of a class of equations \((ax^ 2- b)(ay^ 2-b)=z^ 2-c\) (Q1313565)

This paper provides an algorithmic method for determining all integral non-trivial solutions of the diophantine equation \[ (ax^ 2-b) (ay^ 2- b)= z^ 2-c, \] where \(a,c\in \mathbb{Z}\), \(a\neq 0\), \(b=\pm 1,\pm2, \pm4\). When \(b= \pm 4\), he supposes \(c\equiv 0\pmod 4\). The set \(T^ b_{ac}\) of integral solutions \((x,y,z)\) of the above equation with \[ (ax^ 2-b) (ay^ 2-b) (-abx^ 2+ b^ 2+c) (-aby^ 2+b^ 2+c) =0, \] or (if \(c=0)\) \(x^ 2=y^ 2\), can be trivially computed. The author defines a permutation group \(G\) on integral solutions and a minimal at most finite set \(R\) of integral solutions and proves that the \(G\)-orbits of the set \(R\cup T^ b_{ac}\) exhaust all integral solutions of the title equation. The set \(R\) is algorithmically computed.