Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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



Products of prime powers in binary recurrence sequences. I. The hyperbolic case, with an application to the generalized Ramanujan-Nagell equation

Authors: A. Pethö and B. M. M. de Weger
Journal: Math. Comp. 47 (1986), 713-727
MSC: Primary 11D61; Secondary 11Y50
MathSciNet review: 856715
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: We show how the Gelfond-Baker theory and diophantine approximation techniques can be applied to solve explicitly the diophantine equation $ {G_n} = wp_1^{{m_1}} \cdots p_t^{{m_t}}$ (where $ \{ {G_n}\} _{n = 0}^\infty $ is a binary recurrence sequence with positive discriminant), for arbitrary values of the parameters. We apply this to the equation $ {x^2} + k = p_1^{{z_1}} \cdots p_t^{{z_t}}$, which is a generalization of the Ramanujan-Nagell equation $ {x^2} + 7 = {2^z}$. We present algorithms to reduce upper bounds for the solutions of these equations. The algorithms are easy to translate into computer programs. We present an example which shows that in practice the method works well.

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

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11D61, 11Y50

Retrieve articles in all journals with MSC: 11D61, 11Y50

Additional Information

Article copyright: © Copyright 1986 American Mathematical Society

American Mathematical Society