Cornacchia's algorithm (Q1906662)

The author gives a simplified version of the algorithm of Cornacchia [see \textit{K. H. Hardy}, \textit{J. B. Muskat} and \textit{K. S. Williams}, Math. Comput. 55, 327-343 (1990; Zbl 0713.11088)] for solving \(m= ax^2+ by^2\) \((a,b\in \mathbb{Z}^+)\) by the classical method of solving \(t^2\equiv -b/a \bmod m\) and using continued fractions for each \(t/m\).