The Diophantine equation \(x^2 - Dy^2 = N\), \(D>0\) (Q1589976)

The author discusses an algorithm by Lagrange, inspied by this reviewer's presentation in ``Fundamental number theory with applications'' [CRC Press (1998; Zbl 0943.11001), 333-340]. The algorithm describes how to solve the Diophantine equation \(x^2- Dy^2= N\) for any integer \(N\) and any nonsquare positive integer \(D\). The author presents an approach that uses only continued fractions, which is less complicated than that presented by this reviewer in the above. At the end of the paper there are illustrations presented using some software developed by the author. The paper is well-written and inspired this reviewer to simplify the algorithm even further in [Simple continued fraction solutions to Diophantine equations, Expo. Math. 19, 55-73 (2001; Zbl 0983.11010)].