A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ

DOI10.2307/2008809MaRDI QIDQ3197947zbMATH OpenOpenAlexFDO

Authors Kenneth Hardy, Joseph B. Muskat, Kenneth S. Williams

Publication date 1990

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2008809

zbMATH Keywords

algorithmquadratic diophantine equation

Mathematics Subject Classification ID

Quadratic and bilinear Diophantine equations (11D09) Number-theoretic algorithms; complexity (11Y16) Computer solution of Diophantine equations (11Y50) Representation problems (11D85)

Recommendations

• scientific article; zbMATH DE number 819106
• scientific article; zbMATH DE number 749292
• scientific article; zbMATH DE number 89759
• scientific article; zbMATH DE number 9719
• A New Look at an Old Equation

Cited in

(12)

• Recovering a sum of two squares decomposition
• Continuants and some decompositions into squares
• Linear and sublinear time algorithms for the basis of abelian groups
• Remarks on the algorithms of Cornacchia and Hermite-Serret
• scientific article; zbMATH DE number 89759 (Why is no real title available?)
• Sums of Two Squares Visualized
• Cyclotomic problem, Gauss sums and Legendre curve
• A subexponential algorithm for evaluating large degree isogenies
• Thue's theorem and the diophantine equation $x^2-Dy^2=\pm N$
• scientific article; zbMATH DE number 819106 (Why is no real title available?)
• Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
• End-symmetric continued fractions and quadratic congruences

This page was built for publication: A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3197947)