A simple method for solving the Diophantine equation Y^2=X^4+aX^3+bX^2+cX+d

DOI10.1007/S000170050053zbMATH Open0952.11005OpenAlexW1486332446MaRDI QIDQ1296766FDOQ1296766

Authors: Dimitros Poulakis 

Publication date: 21 November 1999

Published in: Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000170050053

Recommendations

• scientific article; zbMATH DE number 932615
• scientific article; zbMATH DE number 1760761
• The Diophantine equation $X(X + 1) = Y(Y^2 + 1)$.
• The primitive solutions to the Diophantine equation \(2X^4+Y^4=Z^3\)

zbMATH Keywords

hyperelliptic equation

Mathematics Subject Classification ID

Cubic and quartic Diophantine equations (11D25) Diophantine inequalities (11D75)

Cites Work

• Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms. The case of quartic equations
• Fermat's `primitive solutions' and some arithmetic of elliptic curves
• The Diophantine Equation f(x) = g(y)

Cited In (10)

• Near-squares in binary recurrence sequences
• Polynomials with values which are powers of integers.
• Title not available (Why is that?)
• An algorithmic implementation of Runge's method for cubic Diophantine equations
• An algorithm for solving a family of fourth-degree Diophantine equations that satisfy Runge's condition
• Integer points on the curve $Y^{2}=X^{3}\pm p^{k}X$
• On the Diophantine equation \(y^p = f(x_1, x_2,\ldots, x_r)\)
• Solving genus zero Diophantine equations with at most two infinite valuations
• An elementary algorithm for solving a Diophantine equation of degree four with Runge's condition
• Title not available (Why is that?)

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)