An algorithmic implementation of Runge's method for cubic Diophantine equations
From MaRDI portal
Recommendations
- An algorithm for solving a family of fourth-degree Diophantine equations that satisfy Runge's condition
- An algorithm for solving a quartic Diophantine equation satisfying Runge's condition
- An elementary algorithm for solving a Diophantine equation of degree four with Runge's condition
- Solving elliptic diophantine equations: the general cubic case
- On Solving the Diophantine Equation x 3 + y 3 + z 3 = k on a Vector Computer
Cites work
- A quantitative version of Runge's theorem on diophantine equations
- A simple method for solving the Diophantine equation \(Y^2=X^4+aX^3+bX^2+cX+d\)
- An Algorithm for Solving a Certain Class of Diophantine Equations. I
- Classical diophantine equations
- Determination of Bounds for the Solutions to those Binary Diophantine Equations that Satisfy the Hypotheses of Runge's Theorem
- scientific article; zbMATH DE number 3300651 (Why is no real title available?)
- Pell's equation
- Polynomial bounds for the solutions of a class of diophantine equations
Cited in
(5)- An algorithm for solving a family of fourth-degree Diophantine equations that satisfy Runge's condition
- An algorithm for solving a quartic Diophantine equation satisfying Runge's condition
- An Algorithm for Solving a Certain Class of Diophantine Equations. I
- scientific article; zbMATH DE number 7325489 (Why is no real title available?)
- An elementary algorithm for solving a Diophantine equation of degree four with Runge's condition
This page was built for publication: An algorithmic implementation of Runge's method for cubic Diophantine equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5853221)
