Products of Prime Powers in Binary Recurrence Sequences Part II: The Elliptic Case, with an Application to a Mixed Quadratic-Exponential Equation

DOI10.2307/2008186zbMath0623.10012OpenAlexW2169053881MaRDI QIDQ3760601

Benjamin M. M. de Weger

Publication date: 1986

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

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

zbMATH Keywords

reduction algorithmcomputational number theorygeneralized Ramanujan-Nagell equationbinary recurrence sequencesexplicit upper boundsquadratic exponential equationseffectively computable upper boundGelfond-Baker theoryp-adic diophantine approximationproducts of prime powers

Mathematics Subject Classification ID

Recurrences (11B37) Exponential Diophantine equations (11D61)

Related Items (3)

Sums of \(S\)-units in recurrence sequences ⋮ On the resolution of Thue inequalities ⋮ Solving exponential diophantine equations using lattice basis reduction algorithms

This page was built for publication: Products of Prime Powers in Binary Recurrence Sequences Part II: The Elliptic Case, with an Application to a Mixed Quadratic-Exponential Equation