Computing all integer solutions of a general elliptic equation
The authors [Acta Arith. 67, 177-196 (1994; Zbl 0805.11026)] and independently \textit{J. Gebel, A. Pethő} and \textit{H. Zimmer} [Acta Arith. 68, 171-192 (1994; Zbl 0816.11019)] gave a practical method for solving elliptic Diophantine equations that has been successfully applied to cubic and quartic equations. In the present paper the authors extend the methods to elliptic equations of type \(f(u,v)=0\) in \(u,v\in \mathbb{Z}\) where \(f\in \mathbb{Z}[X,Y]\) and the plane curve \(f(u,v)=0\) is an irreducible curve of genus 1. The authors describe a general approach, some claims and a conjecture. For the entire collection see [Zbl 0960.00039].
- Computing all integer solutions of a genus 1 equation
- Elliptic Diophantine equations. A concrete approach via the elliptic logarithm
- Solving elliptic diophantine equations: the general cubic case
- Practical solution of the Diophantine equation $y^2 = x(x+2^ap^b)(x-2^ap^b)$
- Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms. The case of quartic equations
This page was built for publication: Computing all integer solutions of a general elliptic equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2739473)
