On the number of solutions of the generalized Ramanujan-Nagell equation D1X2 + DM2 = 2N+2

DOI10.2989/16073606.2016.1259186zbMath1390.11070OpenAlexW2963692260MaRDI QIDQ4639233

Jiang-Hua Li

Publication date: 3 May 2018

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2016.1259186

zbMATH Keywords

upper boundnumber of solutionsexponential diophantine equationgeneralized Ramanujan-Nagell equation

Mathematics Subject Classification ID

Exponential Diophantine equations (11D61)

Cites Work

• Lucas and Lehmer numbers without primitive divisor
• Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
• On the number of solutions of the generalized Ramanujan-Nagell equation
• Existence of primitive divisors of Lucas and Lehmer numbers
• On the diophantine equation $D₁x² + D₂ = 2^{n+2}$
• Primary cyclotomic units and a proof of Catalans conjecture
• Binomial Thue equations and polynomial powers
• On some exponential Diophantine equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of solutions of the generalized Ramanujan-Nagell equation D₁X² + D^M₂ = 2^N+2