Solving the Diophantine equation \(y^2=x(x^2 - n^2)\) (Q2378047)

In the paper under review, the authors give some necessary conditions satisfied by the integer solutions of the Diophantine equation \(y^2=x(x^2-n^2)\). With the help of these conditions they develop an algorithm for solving this equation. Their method relies on the computation of the Mordell-Weil rank of an associated elliptic curve, the solution of unit equations over some bicyclic biquadratic number fields and the solution of the equation of the form \(b^2x^4-dy^2=1\), where \(a, b\) are suitably chosen integer depending on \(n\). The paper contains several examples which illustrate the application of the method. In the corrigendum the examples 1 and 10 are corrected.