A simple method for solving the Diophantine equation Y^2=X^4+aX^3+bX^2+cX+d
From MaRDI portal
(Redirected from Publication:1296766)
A simple method for solving the Diophantine equation \(Y^2=X^4+aX^3+bX^2+cX+d\)
A simple method for solving the Diophantine equation \(Y^2=X^4+aX^3+bX^2+cX+d\)
The author gives intervals containing the solutions \(x\) of the title equation. The intervals are surprisingly short, depend only on the coefficients of the polynomial involved and make it possible to determine the solutions in many cases without computers. The proof is elementary.
Recommendations
Cites work
Cited in
(10)- Solving genus zero Diophantine equations with at most two infinite valuations
- On the Diophantine equation \(y^p = f(x_1, x_2,\ldots, x_r)\)
- An algorithm for solving a family of fourth-degree Diophantine equations that satisfy Runge's condition
- Polynomials with values which are powers of integers.
- Integer points on the curve $Y^{2}=X^{3}\pm p^{k}X$
- scientific article; zbMATH DE number 3279251 (Why is no real title available?)
- An algorithmic implementation of Runge's method for cubic Diophantine equations
- An elementary algorithm for solving a Diophantine equation of degree four with Runge's condition
- Imaginary quadratic integral points on a hyperelliptic curve of certain type
- Near-squares in binary recurrence sequences
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)