An Efficient Algorithmic Solution of the Diophantine Equation u 2 + 5υ 2 = m

DOI10.2307/2006400zbMath0466.10009OpenAlexW4235265678MaRDI QIDQ3918181

Peter Wilker

Publication date: 1980

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

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

zbMATH Keywords

algorithmEuclidean algorithmquadratic diophantine equationsolution of linear diophantine equation

Mathematics Subject Classification ID

Quadratic and bilinear Diophantine equations (11D09) Radix representation; digital problems (11A63)

Related Items (1)

Thue's theorem and the diophantine equation $x^2-Dy^2=\pm N$

This page was built for publication: An Efficient Algorithmic Solution of the Diophantine Equation u 2 + 5υ 2 = m