Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



An efficient algorithmic solution of the Diophantine equation $u^{2}+5v^{2}=m$

Author: Peter Wilker
Journal: Math. Comp. 35 (1980), 1347-1352
MSC: Primary 10B05; Secondary 10-04, 10A25
MathSciNet review: 583512
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The determination of irreducible elements of the domain $Z[\sqrt { - 5} ]$ requires the solution of the Diophantine equation ${u^2} + 5{v^2} = m$, where m represents certain primes or products of two primes. An algorithm of order $\log m$ is given for the solution of the equation.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 10B05, 10-04, 10A25

Retrieve articles in all journals with MSC: 10B05, 10-04, 10A25

Additional Information

Article copyright: © Copyright 1980 American Mathematical Society