A simple method for solving the Diophantine equation Y^2=X^4+aX^3+bX^2+cX+d
From MaRDI portal
Publication:1296766
Recommendations
Cites work
Cited in
(10)- Near-squares in binary recurrence sequences
- An algorithm for solving a family of fourth-degree Diophantine equations that satisfy Runge's condition
- An elementary algorithm for solving a Diophantine equation of degree four with Runge's condition
- Polynomials with values which are powers of integers.
- An algorithmic implementation of Runge's method for cubic Diophantine equations
- scientific article; zbMATH DE number 3279251 (Why is no real title available?)
- On the Diophantine equation \(y^p = f(x_1, x_2,\ldots, x_r)\)
- Imaginary quadratic integral points on a hyperelliptic curve of certain type
- Integer points on the curve $Y^{2}=X^{3}\pm p^{k}X$
- Solving genus zero Diophantine equations with at most two infinite valuations
This page was built for publication: A simple method for solving the Diophantine equation \(Y^2=X^4+aX^3+bX^2+cX+d\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296766)