On the diophantine equations x2 + 74 = y5 and x2 + 86 = y5
From MaRDI portal
Publication:4875665
DOI10.1017/S0017089500031293zbMATH Open0847.11011OpenAlexW2945746287MaRDI QIDQ4875665FDOQ4875665
Benjamin M. M. de Weger, Maurice Mignotte
Publication date: 13 October 1996
Published in: Glasgow Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0017089500031293
diophantine equationsquintic fieldslower bound for linear forms in logarithmsquintic Thue equationsreduced upper boundsolution in positive integers
Cites Work
Cited In (18)
- Solutions of some generalized Ramanujan-Nagell equations
- Solving Thue equations without the full unit group
- On the Diophantine equation \(x^2+3^a41^b=y^n\)
- On the solutions of certain Lebesgue-Ramanujan-Nagell equations
- Title not available (Why is that?)
- A Lucas-Lehmer approach to generalised Lebesgue-Ramanujan-Nagell equations
- On the diophantine equation x2+5a·pb=yn
- On the Diophantine Equation x 2 + 2 α 5 β 13 γ = y n
- On the Diophantine equation \(x^2+5^a\cdot 11^b=y^n\)
- On Lebesgue–Ramanujan–Nagell Type Equations
- On the Diophantine equation \(x^2+d^{2l+1}=y^n\)
- On the Diophantine equation |𝑎𝑥ⁿ-𝑏𝑦ⁿ|=1
- Title not available (Why is that?)
- AN APPLICATION OF THE MODULAR METHOD AND THE SYMPLECTIC ARGUMENT TO A LEBESGUE–NAGELL EQUATION
- On a problem of Diophantus for higher powers
- ON THE DIOPHANTINE EQUATION x2 + 2a · 5b = yn
- On unit equations with rational coefficients
- Perfect powers with few binary digits and related Diophantine problems, II
Uses Software
Recommendations
This page was built for publication: On the diophantine equations x2 + 74 = y5 and x2 + 86 = y5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875665)