Diophantine chains (Q1053727)

It needs laborious computation to find integer solutions of the equation \[ ax^2 + bxy + cy^2 + dx + ey + f = 0. \] In the present paper the author suggests a process which is an improvement of his own method [Duke Math. J. 37, 261--273 (1970; Zbl 0226.10020)]. But this process only works for equations under some restrictions. Suppose \(a\) divides \(b,d\) and \(c\) divides \(b, e\) and \(b\neq 0\). One gets a chain of solutions of the equation by using the transformations \((x,y)\mapsto (-x-(by/a)-(d/a),y)\) and \((x,y)\mapsto (x,-y-(bx/c)-(e/c)\). The author defines two finite sets \(X'\) and \(Y'\) and proves that every chain of integral solutions contains some member of \(X'\) as an \(x\)-value or some member of \(Y'\) as a \(y\)-value.