On the Diophantine equation \(1 + 2^a + x^b = y^n\)
From MaRDI portal
Publication:740364
DOI10.1016/j.jnt.2014.03.010zbMath1353.11060OpenAlexW2320771254MaRDI QIDQ740364
Publication date: 2 September 2014
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jnt.2014.03.010
Related Items (5)
The polynomial-exponential equation \(1 + 2^a + 6^b = y^q\) ⋮ Unnamed Item ⋮ A Hasse-type principle for exponential Diophantine equations and its applications ⋮ Unnamed Item ⋮ On the binary digits of \(n\) and \(n^2\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On some generalized Lebesgue-Nagell equations
- Two exponential Diophantine equations
- On the Diophantine equation \(x^2 + p^{2k} = y^n\)
- On the diophantine equation \(1+x+y=z\)
- The Magma algebra system. I: The user language
- On the equation \(x^2 + 2^a \cdot 3^b = y^n\)
- The equations \(2^N\pm 2^M\pm 2^L=z^2\)
- The exponential Lebesgue-Nagell equation \(X^2 + P^{2m}= Y^n\)
- Finiteness of odd perfect powers with four nonzero binary digits
- PERFECT POWERS WITH THREE DIGITS
- Carmichael's lambda function
- Classical and modular approaches to exponential Diophantine equations II. The Lebesgue–Nagell equation
- Linear forms in two logarithms and interpolation determinants II
- On the equation $y^m = P(x)$
- The diophantine equation x² + C = yⁿ
- Perfect powers with few binary digits and related Diophantine problems, II
- Perfect powers with few binary digits and related Diophantine problems
- Exponential diophantine equations
This page was built for publication: On the Diophantine equation \(1 + 2^a + x^b = y^n\)